scholarly journals Limit theorems for locally stationary processes

Author(s):  
Rafael Kawka

Abstract We present limit theorems for locally stationary processes that have a one sided time-varying moving average representation. In particular, we prove a central limit theorem (CLT), a weak and a strong law of large numbers (WLLN, SLLN) and a law of the iterated logarithm (LIL) under mild assumptions using a time-varying Beveridge–Nelson decomposition.

Author(s):  
Pingping Zhong ◽  
Weiguo Yang ◽  
Zhiyan Shi ◽  
Yan Zhang

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.


2017 ◽  
Vol 96 (2) ◽  
pp. 333-344
Author(s):  
ALLAN GUT ◽  
ULRICH STADTMÜLLER

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.


1974 ◽  
Vol 11 (3) ◽  
pp. 582-587 ◽  
Author(s):  
G. L. O'Brien

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.


2010 ◽  
Vol 82 (1) ◽  
pp. 31-43 ◽  
Author(s):  
TIEN-CHUNG HU ◽  
PING YAN CHEN ◽  
N. C. WEBER

AbstractThe conditions in the strong law of large numbers given by Li et al. [‘A strong law for B-valued arrays’, Proc. Amer. Math. Soc.123 (1995), 3205–3212] for B-valued arrays are relaxed. Further, the compact logarithm rate law and the bounded logarithm rate law are discussed for the moving average process based on an array of random elements.


2002 ◽  
Vol 39 (3-4) ◽  
pp. 333-359 ◽  
Author(s):  
A. N. Frolov

We find a universal norming sequence in strong limit theorems for increments of sums of i.i.d. random variables with finite first moments and finite second moments of positive parts. Under various one-sided moment conditions our universal theorems imply the following results for sums and their increments: the strong law of large numbers, the law of the iterated logarithm, the Erdős-Rényi law of large numbers, the Shepp law, one-sided versions of the Csörgő-Révész strong approximation laws. We derive new results for random variables from domains of attraction of a normal law and asymmetric stable laws with index αЄ(1,2).


1974 ◽  
Vol 11 (03) ◽  
pp. 582-587 ◽  
Author(s):  
G. L. O'Brien

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.


Sign in / Sign up

Export Citation Format

Share Document