Related papers: Complementary asymptotic analysis for a minimal ra…
We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…
In this paper we survey the almost sure central limit theorem and its functional form (quenched) for stationary and ergodic processes. For additive functionals of a stationary and ergodic Markov chain these theorems are known under the…
We introduce a set of tools which simplify and streamline the proofs of limit theorems concerning near-critical particles in branching random walks under optimal assumptions. We exemplify our method by giving another proof of the…
We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…
Open Quantum Random Walks, as developed in \cite{APSS}, are a quantum generalization of Markov chains on finite graphs or on lattices. These random walks are typically quantum in their behavior, step by step, but they seem to show up a…
Let $\left\{ S_{n},n\geq 0\right\} $ be a random walk whose increment distribution belongs without centering to the domain of attraction of an $% \alpha $-stable law, i.e., there are some scaling constants $a_{n}$ such that the sequence…
It was believed that the Mertens function is a simple random walk in the first versions of the article, so its asymptotic behavior obeys the law of the iterated logarithm. In the latest version of the article we show why the asymptotic…
In this paper we apply techniques of spherical harmonic analysis to prove a local limit theorem, a rate of escape theorem, and a central limit theorem for isotropic random walks on arbitrary thick regular affine buildings of irreducible…
The quasi-likelihood estimator and the Bayesian type estimator of the volatility parameter are in general asymptotically mixed normal. In case the limit is normal, the asymptotic expansion was derived in Yoshida (1997) as an application of…
Several classical results on boundary crossing probabilities of Brownian motion and random walks are extended to asymptotically Gaussian random fields, which include sums of i.i.d. random variables with multidimensional indices,…
We consider a semiclassical random walk with respect to a probability measure associated to a potential with a finite number of critical points. We recover the spectral results from [1] on the corresponding operator in a more general…
This work extends the studies on the minimum and extremal process of a supercritical branching random walk outside the boundary case which cannot be reduced to the boundary case. We study here the situation where the log-generating function…
In this paper, the local asymptotic estimation for the supremum of a random walk and its applications are presented. The summands of the random walk have common long-tailed and generalized strong subexponential distribution. This…
We survey some geometrical properties of trajectories of $d$-dimensional random walks via the application of functional limit theorems. We focus on the functional law of large numbers and functional central limit theorem (Donsker's…
We clarify the asymptotic of the limsup of the size of the neighborhood of concentration of Sinai's walk improving the result in \cite{Pierre3}. Also we get the almost sure limit of the number of points visited more than a small but fixed…
We consider a branching random walk in the non-boundary case where the additive martingale $W_n$ converges a.s. and in mean to some non-degenerate limit $W_\infty$. We first establish the joint tail distribution of $W_\infty$ and the global…
In bandit algorithms, the randomly time-varying adaptive experimental design makes it difficult to apply traditional limit theorems to off-policy evaluation of the treatment effect. Moreover, the normal approximation by the central limit…
Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…
This document contains supplementary material for the main articles in our Random Cayley Graphs project. We prove refined results about simple random walks on the integers and on the cycle. We are primarily interested in the entropy of…
We provide complementary results for a family of models with dependence on their previous $k$-sum. Using a martingale-based approach, we establish a functional central limit theorem and analyze the limiting behavior of the center of mass.…