The central limit theorem for m-dependent variables asymptotically stationary to second order

1954 ◽  
Vol 50 (2) ◽  
pp. 287-292 ◽  
Author(s):  
P. H. Diananda
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Limit Theorems ◽  
Second Order ◽  
Sufficient Condition ◽  
Independent Variables ◽  
The Central Limit Theorem ◽  
Dependent Variables ◽  
Basic Ideas

In a recent paper (3) the Lindeberg-Lévy theorem (2) was extended for certain types of stationary dependent variables. In the present paper mainly the same basic ideas as were used in (3) are employed to give central limit theorems for m-dependent scalar variables (a) stationary to second order and (b) asymptotically stationary to second order, the sufficient condition in each case being akin to the Linde-berg condition ((1), p. 57) for independent variables. The analogue of the main theorem for vector variables is given. An extension of the Lindeberg-Lévy theorem is derived.

The central limit theorem for m-dependent variables

1955 ◽  
Vol 51 (1) ◽  
pp. 92-95 ◽  
Author(s):  
P. H. Diananda
Keyword(s):  
Standard Deviation ◽  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Limit Theorems ◽  
Sufficient Conditions ◽  
The Central Limit Theorem ◽  
Lindeberg Condition ◽  
Dependent Variables ◽  
Basic Ideas

In a previous paper (4) central limit theorems were obtained for sequences of m-dependent random variables (r.v.'s) asymptotically stationary to second order, the sufficient conditions being akin to the Lindeberg condition (3). In this paper similar theorems are obtained for sequences of m-dependent r.v.'s with bounded variances and with the property that for large n, where s′n is the standard deviation of the nth partial sum of the sequence. The same basic ideas as in (4) are used, but the proofs have been simplified. The results of this paper are examined in relation to earlier ones of Hoeffding and Robbins(5) and of the author (4). The cases of identically distributed r.v.'s and of vector r.v.'s are mentioned.

Heavy traffic limit theorems in fluctuation theory

1978 ◽  
Vol 10 (04) ◽  
pp. 852-866
Author(s):  
A. J. Stam
Keyword(s):  
Random Walk ◽  
Central Limit Theorem ◽  
Limit Theorem ◽  
Random Walks ◽  
Central Limit ◽  
Limit Theorems ◽  
Heavy Traffic ◽  
The Central Limit Theorem ◽  
Heavy Traffic Limit ◽  
Oscillating Random Walk

Let be a family of random walks with For ε↓0 under certain conditions the random walk U (∊) n converges to an oscillating random walk. The ladder point distributions and expectations converge correspondingly. Let M ∊ = max {U (∊) n , n ≧ 0}, v 0 = min {n : U (∊) n = M ∊}, v 1 = max {n : U (∊) n = M ∊}. The joint limiting distribution of ∊2σ∊ –2 v 0 and ∊σ∊ –2 M ∊ is determined. It is the same as for ∊2σ∊ –2 v 1 and ∊σ–2 ∊ M ∊. The marginal ∊σ–2 ∊ M ∊ gives Kingman's heavy traffic theorem. Also lim ∊–1 P(M ∊ = 0) and lim ∊–1 P(M ∊ < x) are determined. Proofs are by direct comparison of corresponding probabilities for U (∊) n and for a special family of random walks related to MI/M/1 queues, using the central limit theorem.

Almost sure limit theorems for random allocations

2005 ◽  
Vol 42 (2) ◽  
pp. 173-194
Author(s):  
István Fazekas ◽  
Alexey Chuprunov
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Limit Theorems ◽  
Random Variables ◽  
Central Domain ◽  
Almost Sure Limit Theorem ◽  
The Central Limit Theorem ◽  
Almost Sure Limit Theorems ◽  
Poisson Limit

Almost sure limit theorems are presented for random allocations. A general almost sure limit theorem is proved for arrays of random variables. It is applied to obtain almost sure versions of the central limit theorem for the number of empty boxes when the parameters are in the central domain. Almost sure versions of the Poisson limit theorem in the left domain are also proved.

Heavy traffic limit theorems in fluctuation theory

1978 ◽  
Vol 10 (4) ◽  
pp. 852-866
Author(s):  
A. J. Stam
Keyword(s):  
Random Walk ◽  
Central Limit Theorem ◽  
Limit Theorem ◽  
Random Walks ◽  
Central Limit ◽  
Limit Theorems ◽  
Heavy Traffic ◽  
The Central Limit Theorem ◽  
Heavy Traffic Limit ◽  
Oscillating Random Walk

Let be a family of random walks with For ε↓0 under certain conditions the random walk U(∊)n converges to an oscillating random walk. The ladder point distributions and expectations converge correspondingly. Let M∊ = max {U(∊)n, n ≧ 0}, v0 = min {n : U(∊)n = M∊}, v1 = max {n : U(∊)n = M∊}. The joint limiting distribution of ∊2σ∊–2v0 and ∊σ∊–2M∊ is determined. It is the same as for ∊2σ∊–2v1 and ∊σ–2∊M∊. The marginal ∊σ–2∊M∊ gives Kingman's heavy traffic theorem. Also lim ∊–1P(M∊ = 0) and lim ∊–1P(M∊ < x) are determined. Proofs are by direct comparison of corresponding probabilities for U(∊)n and for a special family of random walks related to MI/M/1 queues, using the central limit theorem.

Functional and random central limit theorems for the Robbins-Munro process

1976 ◽  
Vol 13 (1) ◽  
pp. 148-154 ◽  
Author(s):  
D. L. McLeish
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Asymptotic Normality ◽  
Central Limit ◽  
Limit Theorems ◽  
Central Limit Theorems ◽  
Functional Central Limit Theorem ◽  
Stopping Rules ◽  
The Central Limit Theorem ◽  
Functional Central Limit

A functional central limit theorem extending the central limit theorem of Chung (1954) for the Robbins–Munro procedure is proved. It is shown that the asymptotic normality is preserved under certain random stopping rules.

Central Limit Theorems and Asymptotic Spectral Analysis on Large Graphs

1998 ◽  
Vol 01 (02) ◽  
pp. 221-246 ◽  
Author(s):  
Akihito Hora
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Limit Theorems ◽  
Random Variable ◽  
Spectral Structure ◽  
Regular Graphs ◽  
Large Graphs ◽  
The Central Limit Theorem ◽  
Distance Regular Graphs

Regarding the adjacency matrix of a graph as a random variable in the framework of algebraic or noncommutative probability, we discuss a central limit theorem in which the size of a graph grows in several patterns. Various limit distributions are observed for some Cayley graphs and some distance-regular graphs. To obtain the central limit theorem of this type, we make combinatorial analysis of mixed moments of noncommutative random variables on one hand, and asymptotic analysis of spectral structure of the graph on the other hand.

Sign in / Sign up

Export Citation Format

Share Document