Related papers: A Central Limit Theorem for the average target hit…
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…
Functional limit theorem for continuous-time random walks (CTRW) are found in general case of dependent waiting times and jump sizes that are also position dependent. The limiting anomalous diffusion is described in terms of fractional…
We consider random walks in dynamic random environments which arise naturally as spatial embeddings of ancestral lineages in spatial locally regulated population models. In particular, as the main result, we prove the quenched central limit…
Network centrality has important implications well beyond its role in physical and information transport analysis; as such, various quantum walk-based algorithms have been proposed for measuring network vertex centrality. In this work, we…
We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…
It is known that a random walk on $\Z^d$ among i.i.d. uniformly elliptic random bond conductances verifies a central limit theorem. It is also known that approximations of the covariance matrix can be obtained by considering periodic…
In this article we consider transient random walks on HNN extensions of finitely generated groups. We prove that the rate of escape w.r.t. some generalised word length exists. Moreover, a central limit theorem with respect to the…
Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
We study the mean traversal time for a class of random walks on Newman-Watts small-world networks, in which steps around the edge of the network occur with a transition rate F that is different from the rate f for steps across small-world…
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…
Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy…
We prove that the spectral radius of a strongly irreducible random walk on GLd(R) (or more generally the vector of moduli of eigenvalues of a Zariski-dense random walk on a reductive group) satisfies a central limit theorem under an order…
In this paper, we study second order fluctuations for the size of the range of a critical branching random walk (BRW) in $\mathbb Z^d$. We consider the BRW with geometric offspring indexed by the Kesten tree, and show that the size of its…
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…
Graph products have been extensively applied to model complex networks with striking properties observed in real-world complex systems. In this paper, we study the hitting times for random walks on a class of graphs generated iteratively by…
For a L\'evy basis $L$ on $\mathbb{R}^d$ and a suitable kernel function $f:\mathbb{R}^d \to \mathbb{R}$, consider the continuous spatial moving average field $X=(X_t)_{t\in \mathbb{R}^d}$ defined by $X_t = \int_{\mathbb{R}^d} f(t-s) \,…
We come up with a class of distributed quantized averaging algorithms on asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the…
We consider the range of random walks up to time n, R_n, on graphs satisfying a uniform condition. This condition is characterized by potential theory. Not only all vertex transitive graphs but also many non-regular graphs satisfy the…
The main results in this paper are about the full coalescence time $\mathsf{C}$ of a system of coalescing random walks over a finite graph $G$. Letting $\mathsf{m}(G)$ denote the mean meeting time of two such walkers, we give sufficient…