Related papers: A local central limit theorem for random walks on …

In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…

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 prove a central limit theorem for random walks with finite variance on linear groups.

Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq 1$, where $(g_n)_{n\geq 1}$ is a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group ${\rm GL}(V)$ with $V=\mathbb R^d$.…

We consider a symmetric random walk on the $\nu$-dimensional lattice, whose exit probability from the origin is modified by an antisymmetric perturbation and prove the local central limit theorem for this process. A short-range correction…

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…

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…

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…

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…

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…

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…

Convergence rate analyses of random walk Metropolis-Hastings Markov chains on general state spaces have largely focused on establishing sufficient conditions for geometric ergodicity or on analysis of mixing times. Geometric ergodicity is a…

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…

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…

Chen [Ann. Appl. Probab. {\bf 11} (2001), 1242--1262] derived exact convergence rates in a central limit theorem and a local limit theorem for a supercritical branching Wiener process.We extend Chen's results to a branching random walk…

We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…

We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…

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…

The method of the quantum probability theory only requires simple structural data of graph and allows us to avoid a heavy combinational argument often necessary to obtain full description of spectrum of the adjacency matrix. In the present…

Unlike classical simple random walks, one-dimensional random walks in random environments (RWRE) are known to have a wide array of potential limiting distributions. Under certain assumptions, however, it is known that CLT-like limiting…