An Introduction To Probability Theory And Its Application

By Mamta Mittal. 2003

1,032 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/b6cc04a9094d4e749c47bc2fea5be73fede4aded

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Nonparametric estimation in null recurrent time series (2001, unknown): “If the atom s ν in (3.4) is changed to s′ ν′ then (cf. Remark 3.1) πs′ = πs πs s′ Ls′ ∼ πs s′ Ls The asymptotic expression (3.13) is connected to the Tauberian theorem [Feller (1971), page 447].”
Randomly spread CDMA: asymptotics via statistical physics (2005, background): “…take the same SNR becomes unnecessary, we have proved by (138), (147), (159) and (160) that for every SNR distribution and every user k 2 f 1 ; : : : Since the moments (161) are uniformly bounded, the distribution is thus uniquely determined by the moments due to Carleman’s Theorem [65, p. 227].”
Levy-stable distributions revisited: tail index > 2 does not exclude the Levy-stable regime (2001, background): “, original sample ordered so that X(1) ≥ X(2) ≥ · · · ≥ X(N), drawn from a population with law F , then, the Hill estimate of α based on the k largest order statistics is:”
Colloquium: Statistical mechanics of money, wealth, and income (2009, methodology): “A similar scenario is the Bernoulli trials (Feller, 1966), where individuals have a constant probability of increasing their income by a fixed amount.”
Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System (2007, methodology): “Given that the number of customers in the inﬁnite-server model is Poisson, we immediately obtain the normal approximation from the well-known approximation discussed in most elementary probability text-books (e.g., p. 190 in Feller 1968).”
Universal proximity effect in target search kinetics in the few-encounter limit (2016, background): “[48]), where the superscript (k) denotes the kth derivative with respect to s evaluated at s 1⁄4 0 [49].”
Group Formation in Risk-Sharing Arrangements (2003, unknown): “(1 − δ)u(h− tk) + δv(t, n) ≥ (1 − δ)u(h) + δṽ(s) (12)”
Exchangeable pairs and Poisson approximation (2004, background): “We next give a brief treatment of the basic probability problems treated in previous sections.”
Markov Chains and Mixing Times (2008, methodology): “Before proceeding we mention that there are other algorithms that may be used for generating perfect samples from the stationary distribution of a Markov chain, including Fill’s algorithm (Fill, 1998, Fill, Machida, Murdoch, and Rosenthal, 2000), “dominated CFTP” (Kendall and Møller, 2000), “read-on”
Step and island dynamics at solid/vacuum and solid/liquid interfaces (2001, background): “random walk [43], and consequently, G(y) is a linear function of the distance y along the step(8) [67]:”
An Efficient k-Means Clustering Algorithm: Analysis and Implementation (2002, methodology): “Our proof makes use of the following straightforward generalization of Cheby-shev’s inequality (see [20]) to multivariate distributions.”