Related papers: Finite-Memory Elephant Random Walk and the Central…

There is a long history of establishing central limit theorems for Markov chains. Quantitative bounds for chains with a spectral gap were proved by Mann and refined later. Recently, rates of convergence for the total variation distance were…

In this article we shall derive functional limit theorems for the multi-dimensional elephant random walk (MERW) and thus extend the results provided for the one-dimensional marginal by Bercu and Laulin (2019). The MERW is a non-Markovian…

Adaptive and interacting Markov Chains Monte Carlo (MCMC) algorithms are a novel class of non-Markovian algorithms aimed at improving the simulation efficiency for complicated target distributions. In this paper, we study a general…

Our goal is to investigate the asymptotic behavior of the center of mass of the elephant random walk, which is a discrete-time random walk on integers with a complete memory of its whole history. In the diffusive and critical regimes, we…

We prove two theorems related to the Central Limit Theorem (CLT) for Martin-L\"of Random (MLR) sequences. Martin-L\"of randomness attempts to capture what it means for a sequence of bits to be "truly random". By contrast, CLTs do not make…

We present a general functional central limit theorem started at a point also known under the name of quenched. As a consequence, we point out several new classes of stationary processes, defined via projection conditions, which satisfy…

We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…

We prove a quenched functional central limit theorem (quenched FCLT) for the sums of a random field (r.f.) along a Z d-random walk in different frameworks: probabilistic (when the r.f. is i.i.d. or a moving average of i.i.d. random…

This paper provides a Central Limit Theorem (CLT) for a process $\{\theta_n, n\geq 0\}$ satisfying a stochastic approximation (SA) equation of the form $\theta_{n+1} = \theta_n + \gamma_{n+1} H(\theta_n,X_{n+1})$; a CLT for the associated…

Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…

We prove a quenched functional central limit theorem (quenched FCLT) for the sums of a random field (r.f.) along a 2d-random walk in different situations: when the r.f. is iid with a second order moment (random sceneries), or when it is…

The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…

In this paper we consider stationary Markov chains with trivial two-sided tail sigma field, and prove that additive functionals satisfy the central limit theorem provided the variance of partial sums divided by n is bounded.

We consider asymptotic behavior of Fourier transforms of stationary ergodic sequences with finite second moments. We establish a central limit theorem (CLT) for almost all frequencies and also an annealed CLT. The theorems hold for all…

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for general additive…

In this note, we establish a functional central limit theorem for the capacity of the range for a class of $\alpha$-stable random walks on the integer lattice $\mathbb{Z}^d$ with $d > 5\alpha/2$. Using similar methods, we also prove an…

In this article we consider a natural class of random walks on free products of graphs, which arise as convex combinations of random walks on the single factors. From the works of Gilch [6,7] it is well-known that for these random walks the…

In this paper, we develop a general law of large numbers and central limit theorem for cumulative reward processes associated with finite state Markov jump processes with non-stationary transition rates. Such models commonly arise in…

In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…