Laws of iterated logarithm for transient random walks in random environments

We consider laws of iterated logarithm for one-dimensional transient random walks in random environments. A quenched law of iterated logarithm is presented for transient random walks in general ergodic random environments, including independent identically distributed environments and uniformly ergodic environments.     

Weak ergodicity and products of random matrices

A representation for a weakly ergodic sequence of (nonstochastic) matrices allows products of nonnegative matrices which eventually become strictly positive to be expressed via products of some associated stochastic matrices and ratios of values of a certain function. This formula used in a random setup leads to a representation for the logarithm of a random matrix product. If the sequence of random matrices is in addition stationary then automatically almost all sequences are weakly ergodic, and the representation is expressed in terms of an one-dimensional stationary process. This permits properties of products of random matrices to be deduced from the latter. Second moment assumptions guarantee that central limit theorems and laws of the iterated logarithm hold for the random matrix products if and only if they hold for the corresponding stationary process. Finally, a central limit theorem for some classes of weakly dependent stationary random matrices is derived doing away with the restriction of boundedness of the ratios of colum entries assumed by previous studies. Extensions beyond stationarity are discussed.     

Classical limit theorems for measure-valued Markov processes

Laws of large numbers, central limit theorems, and laws of the iterated logarithm are obtained for discrete and continuous time Markov processes whose state space is a set of measures. These results apply to each measure-valued stochastic process itself and not simply to its real-valued functionals.     

Exponential inequalities under the sub-linear expectations with applications to laws of the iterated logarithm

Kolmogorov’s exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper establishes the Kolmogorov type exponential inequalities of the partial sums of independent random variables as well as negatively dependent random variables under the sub-linear expectations. As applications of the exponential inequalities, the laws of the iterated logarithm in the sense of non-additive capacities are proved for independent or negatively dependent identically distributed random variables with finite second order moments. For deriving a lower bound of an exponential inequality, a central limit theorem is also proved under the sub-linear expectation for random variables with only finite variances.     

Moderate and Small Deviations for the Ranges of One-Dimensional Random Walks

We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup and the liminf laws of the iterated logarithm. We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup and the liminf laws of the iterated logarithm.     

On the local time of random walk on the 2-dimensional comb

We study the path behaviour of general random walks, and that of their local times, on the 2-dimensional comb lattice C² that is obtained from Z² by removing all horizontal edges off the x-axis. We prove strong approximation results for such random walks and also for their local times. Concentrating mainly on the latter, we establish strong and weak limit theorems, including Strassen-type laws of the iterated logarithm, Hirsch-type laws, and weak convergence results in terms of functional convergence in distribution.     

Transient Nearest Neighbor Random Walk on the Line

We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over which the walk runs through (always from left to right) without ever returning.     

Chung-type law of the iterated logarithm for continuous time random walk

A continuous time random walk is a random walk subordinated to a renewal process used in physics to model anomalous diffusion. In this paper, we establish a Chung-type law of the iterated logarithm for continuous time random walk with jumps and waiting times in the domains of attraction of stable laws.     

On the Bahadur representation of sample quantiles for sequences of φ-mixing random variables

The object of the present investigation is to show that the elegant asymptotic almost-sure representation of a sample quantile for independent and identically distributed random variables, established by Bahadur [1] holds for a stationary sequence of φ-mixing random variables. Two different orders of the remainder term, under different φ-mixing conditions, are obtained and used for proving two functional central limit theorems for sample quantiles. It is also shown that the law of iterated logarithm holds for quantiles in stationary φ-mixing processes.     

A NOTE ON OSCILLATION MODULUS OF PL-PROCESS AND ITS APPLICATIONS UNDER RANDOM CENSORSHIP

The strong limit results of oscillation modulus of PL-process are established in this paper when the density function is not continuous function for censored data. The rates of convergence of oscillation modulus of PL-process are sharp under week condition. These results can be used to derive laws of the iterated logarithm of random bandwidth kernel estimator and nearest neighborhood estimator of density under continuous conditions of density function being not assumed.