Related papers: A Central Limit Theorem for the average target hit…
We study random walks on the isometry group of a Gromov hyperbolic space or Teichm\"uller space. We prove that the translation lengths of random isometries satisfy a central limit theorem if and only if the random walk has finite second…
How long does it take a random walker to reach a given target point? This quantity, known as a first passage time (FPT), has led to a growing number of theoretical investigations over the last decade1. The importance of FPTs originates from…
Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. To be analogous to the hitting time for a classical walk, the quantum hitting time must involve repeated measurements as…
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…
Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases. However,…
We consider a branching random walk on $d$-dimensional real space with immigration in a time-dependent random environment. Let $Z_n(\mathbf t)$ be the so-called partition function of the process, namely, the moment generating function of…
In this paper, the question of expected time to convergence is addressed for unbiased quantized consensus on undirected connected graphs, and some strong results are obtained. The paper first provides a tight expression for the expected…
Let $\nu\in M^1([0,\infty[)$ be a fixed probability measure. For each dimension $p\in\b N$, let $(X_n^p)_{n\ge1}$ be i.i.d. $\b R^p$-valued radial random variables with radial distribution $\nu$. We derive two central limit theorems for $…
Combining cross-section and time series data is a long and well established practice in empirical economics. We develop a central limit theory that explicitly accounts for possible dependence between the two data sets. We focus on common…
In this article we consider L\'evy driven continuous time moving average processes observed on a lattice, which are stationary time series. We show asymptotic normality of the sample mean, the sample autocovariances and the sample…
We prove the annealed Central Limit Theorem for random walks in bistochastic random environments on $Z^d$ with zero local drift. The proof is based on a "dynamicist's interpretation" of the system, and requires a much weaker condition than…
We analyze a class of distributed quantized consensus algorithms for arbitrary static networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network,…
Random walk based distributed algorithms make use of a token that circulates in the system according to a random walk scheme to achieve their goal. To study their efficiency and compare it to one of the deterministic solutions, one is led…
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 establish a quenched local central limit theorem for the dynamic random conductance model on $\mathbb{Z}^d$ only assuming ergodicity with respect to space-time shifts and a moment condition. As a key analytic ingredient we show H\"older…
Analytical results for the distribution of first hitting times of random walks on Erd\H{o}s-R\'enyi networks are presented. Starting from a random initial node, a random walker hops between adjacent nodes until it hits a node which it has…
Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…
We study the fluctuations of the eigenvalues of real valued large centrosymmetric random matrices via its linear eigenvalue statistic. This is essentially a central limit theorem (CLT) for sums of dependent random variables. The dependence…
The one-dimensional elephant random walk is a typical model of discrete-time random walk with step-reinforcement, and is introduced by Sch\"{u}tz and Trimper (2004). It has a parameter $\alpha \in (-1,1)$: The case $\alpha=0$ corresponds to…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…