Related papers: Local limit theorems for sequences of simple rando…
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 develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
The paper consists of two parts. In the first part we review recent work on limit theorems for random walks in random environment (RWRE) on a strip with jumps to the nearest layers. In the second part, we prove the quenched Local Limit…
We study an extended dynamical system on the non-negative real line with piecewise linear non-uniformly expanding local dynamics. With a uniformly distributed initial state, the distribution of successive states coincides with that of a…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…
We investigate random walks on the general linear group constrained within a specific domain, with a focus on their asymptotic behavior. In a previous work [38], we constructed the associated harmonic measure, a key element in formulating…
We establish an abstract local ergodic theorem, under suitable space-time scaling, for the (boundary-driven) symmetric exclusion process on an increasing sequence of balls covering an infinite weighted graph. The proofs are based on 1-block…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
Recent progress on the understanding of the Random Conductance Model is reviewed. A particular emphasis is on homogenization results such as functional central limit theorems, local limit theorems and heat kernel estimates for almost every…
In this paper, we obtain a local limit theorem for the Kemperman's model of oscillating random walk on $\mathbb{Z}$; it extends the existing results for classical random walks on $\mathbb Z$ or reflected random walks on $\mathbb N_0$. The…
We give a local central limit theorem for simple random walks on Z^d, including Gaussian error estimates. The detailed proof combines standard large deviation techniques with Cramer-Edgeworth expansions for lattice distributions.
We use an inequality of Sidorenko to show a general relation between local and global subgraph counts and degree moments for locally weakly convergent sequences of sparse random graphs. This yields an optimal criterion to check when the…
We reduce the local limit theorem for a non-compact semisimple Lie group acting on its symmetric space to establishing that a natural operator associated to the measure is quasicompact. Under strong Diophantine assumptions on the underlying…
We consider a simple random walk (dimension one, nearest neighbour jumps) in a quenched random environment. The goal of this work is to provide sufficient conditions, stated in terms of properties of the environment, under which the Central…
A simple random walk and a Brownian motion are considered on a spider that is a collection of half lines (we call them legs) joined in the origin. We give a strong approximation of these two objects and their local times. For fixed number…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…
We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a…