Limit theorems for sums of chain-dependent processes

1974 ◽  
Vol 11 (3) ◽  
pp. 582-587 ◽  
Author(s):  
G. L. O'Brien
Keyword(s):  
Markov Chain ◽  
Limit Theorem ◽  
Limit Theorems ◽  
Law Of Large Numbers ◽  
Initial Distribution ◽  
Stationary Case ◽  
Strong Law ◽  
Iterated Logarithm ◽  
Large Numbers ◽  
Dependent Processes

Chain-dependent processes, also called sequences of random variables defined on a Markov chain, are shown to satisfy the strong law of large numbers. A central limit theorem and a law of the iterated logarithm are given for the case when the underlying Markov chain satisfies Doeblin's hypothesis. The proofs are obtained by showing independence of the initial distribution of the chain and by then restricting attention to the stationary case.

Limit theorems for sums of chain-dependent processes

1974 ◽  
Vol 11 (03) ◽  
pp. 582-587 ◽  
Author(s):  
G. L. O'Brien
Keyword(s):  
Markov Chain ◽  
Limit Theorem ◽  
Limit Theorems ◽  
Law Of Large Numbers ◽  
Initial Distribution ◽  
Stationary Case ◽  
Strong Law ◽  
Iterated Logarithm ◽  
Large Numbers ◽  
Dependent Processes

Chain-dependent processes, also called sequences of random variables defined on a Markov chain, are shown to satisfy the strong law of large numbers. A central limit theorem and a law of the iterated logarithm are given for the case when the underlying Markov chain satisfies Doeblin's hypothesis. The proofs are obtained by showing independence of the initial distribution of the chain and by then restricting attention to the stationary case.

On record and inter-record times for a sequence of random variables defined on a Markov chain

1975 ◽  
Vol 7 (01) ◽  
pp. 195-214 ◽  
Author(s):  
Gary Lee Guthrie ◽  
Paul T. Holmes
Keyword(s):  
Markov Chain ◽  
Law Of Large Numbers ◽  
Random Variables ◽  
Finite Markov Chain ◽  
Record Times ◽  
Strong Law ◽  
The Central Limit Theorem ◽  
Iterated Logarithm ◽  
Continuous Parameter ◽  
Large Numbers

The familiar three theorems of Rényi concerning the record times in an i.i.d. sequence of random variables are extended to the record times and inter-record times of a sequence of dependent, non-identically distributed random variables defined on a finite Markov chain. These theorems are the Central Limit Theorem (C.L.T.), the Strong Law of Large Numbers (S.L.L.N.) and the Law of the Iterated Logarithm (L.I.L.). Similar results are also obtained for m-record times, inter-m-record times, and for the continuous parameter situation when observations are taken at the epochs of a Poisson process.

On record and inter-record times for a sequence of random variables defined on a Markov chain

1975 ◽  
Vol 7 (1) ◽  
pp. 195-214 ◽  
Author(s):  
Gary Lee Guthrie ◽  
Paul T. Holmes
Keyword(s):  
Markov Chain ◽  
Law Of Large Numbers ◽  
Random Variables ◽  
Finite Markov Chain ◽  
Record Times ◽  
Strong Law ◽  
The Central Limit Theorem ◽  
Iterated Logarithm ◽  
Continuous Parameter ◽  
Large Numbers

The familiar three theorems of Rényi concerning the record times in an i.i.d. sequence of random variables are extended to the record times and inter-record times of a sequence of dependent, non-identically distributed random variables defined on a finite Markov chain. These theorems are the Central Limit Theorem (C.L.T.), the Strong Law of Large Numbers (S.L.L.N.) and the Law of the Iterated Logarithm (L.I.L.). Similar results are also obtained for m-record times, inter-m-record times, and for the continuous parameter situation when observations are taken at the epochs of a Poisson process.

scholarly journals Limit theorems for random polytopes with vertices on convex surfaces

2018 ◽  
Vol 50 (4) ◽  
pp. 1227-1245 ◽  
Author(s):  
N. Turchi ◽  
F. Wespi
Keyword(s):  
Limit Theorem ◽  
Limit Theorems ◽  
Law Of Large Numbers ◽  
Normal Approximation ◽  
Smooth Convex ◽  
Variance Bounds ◽  
Strong Law ◽  
Intrinsic Volumes ◽  
Large Numbers ◽  
Approximation Bound

Abstract We consider the random polytope Kn, defined as the convex hull of n points chosen independently and uniformly at random on the boundary of a smooth convex body in ℝd. We present both lower and upper variance bounds, a strong law of large numbers, and a central limit theorem for the intrinsic volumes of Kn. A normal approximation bound from Stein's method and estimates for surface bodies are among the tools involved.

scholarly journals Limit theorems for fuzzy random variables

1986 ◽  
Vol 407 (1832) ◽  
pp. 171-182 ◽  
Keyword(s):  
Banach Space ◽  
Limit Theorem ◽  
Limit Theorems ◽  
Law Of Large Numbers ◽  
Random Variables ◽  
Embedding Theorems ◽  
Fuzzy Random Variables ◽  
Strong Law ◽  
Large Numbers ◽  
Fuzzy Random

A strong law of large numbers and a central limit theorem are proved for independent and identically distributed fuzzy random variables, whose values are fuzzy sets with compact levels. The proofs are based on embedding theorems as well as on probability techniques in Banach space.

scholarly journals Subcritical Sevastyanov branching processes with nonhomogeneous Poisson immigration

2017 ◽  
Vol 54 (2) ◽  
pp. 569-587 ◽  
Author(s):  
Ollivier Hyrien ◽  
Kosto V. Mitov ◽  
Nikolay M. Yanev
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Limit Theorems ◽  
Law Of Large Numbers ◽  
Branching Processes ◽  
Asymptotic Properties ◽  
Cell Populations ◽  
Subcritical Case ◽  
Immigration Process ◽  
Large Numbers

Abstract We consider a class of Sevastyanov branching processes with nonhomogeneous Poisson immigration. These processes relax the assumption required by the Bellman–Harris process which imposes the lifespan and offspring of each individual to be independent. They find applications in studies of the dynamics of cell populations. In this paper we focus on the subcritical case and examine asymptotic properties of the process. We establish limit theorems, which generalize classical results due to Sevastyanov and others. Our key findings include a novel law of large numbers and a central limit theorem which emerge from the nonhomogeneity of the immigration process.

SOME LIMIT THEOREMS OF DELAYED AVERAGES FOR COUNTABLE NONHOMOGENEOUS MARKOV CHAINS

2019 ◽  
pp. 1-19
Author(s):  
Pingping Zhong ◽  
Weiguo Yang ◽  
Zhiyan Shi ◽  
Yan Zhang
Keyword(s):  
Information Theory ◽  
Markov Chains ◽  
Limit Theorems ◽  
Law Of Large Numbers ◽  
Strong Law ◽  
Strong Ergodicity ◽  
Large Numbers ◽  
Nonhomogeneous Markov Chains ◽  
Definition Of ◽  
Bivariate Functions

AbstractThe purpose of this paper is to establish some limit theorems of delayed averages for countable nonhomogeneous Markov chains. The definition of the generalized C-strong ergodicity and the generalized uniformly C-strong ergodicity for countable nonhomogeneous Markov chains is introduced first. Then a theorem about the generalized C-strong ergodicity and the generalized uniformly C-strong ergodicity for the nonhomogeneous Markov chains is established, and its applications to the information theory are given. Finally, the strong law of large numbers of delayed averages of bivariate functions for countable nonhomogeneous Markov chains is proved.

scholarly journals A Note on Rényi's ‘Record’ Problem and Engel's Series

2018 ◽  
Vol 61 (2) ◽  
pp. 363-369 ◽  
Author(s):  
Lulu Fang ◽  
Min Wu
Keyword(s):  
Number Theory ◽  
Large Deviations ◽  
Markov Processes ◽  
Classical Limit ◽  
Limit Theorems ◽  
London Math ◽  
Law Of Large Numbers ◽  
Record Times ◽  
Iterated Logarithm ◽  
Large Numbers

AbstractIn 1973, Williams [D. Williams, On Rényi's ‘record’ problem and Engel's series, Bull. London Math. Soc.5 (1973), 235–237] introduced two interesting discrete Markov processes, namely C-processes and A-processes, which are related to record times in statistics and Engel's series in number theory respectively. Moreover, he showed that these two processes share the same classical limit theorems, such as the law of large numbers, central limit theorem and law of the iterated logarithm. In this paper, we consider the large deviations for these two Markov processes, which indicate that there is a difference between C-processes and A-processes in the context of large deviations.

COMPLETE CONVERGENCE FOR ARRAYS AND THE LAW OF THE SINGLE LOGARITHM

2017 ◽  
Vol 96 (2) ◽  
pp. 333-344
Author(s):  
ALLAN GUT ◽  
ULRICH STADTMÜLLER
Keyword(s):  
Limit Theorems ◽  
Complete Convergence ◽  
Law Of Large Numbers ◽  
Almost Sure Convergence ◽  
Strong Law ◽  
Moment Conditions ◽  
Large Numbers ◽  
Distributed Arrays ◽  
The Law ◽  
Independent And Identically Distributed

The present paper is devoted to complete convergence and the strong law of large numbers under moment conditions near those of the law of the single logarithm (LSL) for independent and identically distributed arrays. More precisely, we investigate limit theorems under moment conditions which are stronger than $2p$ for any $p<2$, in which case we know that there is almost sure convergence to 0, and weaker than $E\,X^{4}/(\log ^{+}|X|)^{2}<\infty$, in which case the LSL holds.

Sign in / Sign up

Export Citation Format

Share Document