Related papers: Lamplighter random walks on fractals
We study the operator associated to a random walk on $\R^d$ endowed with a probability measure. We give a precise description of the spectrum of the operator near $1$ and use it to estimate the total variation distance between the iterated…
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…
In [Kozma-Toth, Ann. Probab. v 45, pp 4307-4347 (2017)] the weak CLT was established for random walks in doubly stochastic (or, divergence-free) random environments, under the following conditions: 1. Strict ellipticity assumed for the…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
Based on two-sided heat kernel estimates for a class of symmetric jump processes on metric measure spaces, the laws of the iterated logarithm (LILs) for sample paths, local times and ranges are established. In particular, the LILs are…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
We study the effect of random scattering in quantum walks on a finite graph and compare it with the effect of repeated measurements. To this end, a constructive approach is employed by introducing a localized and a delocalized basis for the…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
There exist important stochastic physical processes involving infinite mean waiting times. The mean divergence has dramatic consequences on the process dynamics. Fractal time random walks, a diffusion process, and subrecoil laser cooling, a…
We introduce the discrete affine group of a regular tree as a finitely generated subgroup of the affine group. We describe the Poisson boundary of random walks on it as a space of configurations. We compute isoperimetric profile and Hilbert…
We extend results of Y. Benoist and J.-F. Quint concerning random walks on homogeneous spaces of simple Lie groups to the case where the measure defining the random walk generates a semigroup which is not necessarily Zariski dense, but…
We use a random walk in the ensemble of impurity configurations to generate a Brownian motion model for energy levels in disordered conductors. Treating arc-length along the random walk as fictitous time, the resulting Langevin equation…
We prove that in presence of $L^2$ Gaussian estimates, so-called Davies-Gaffney estimates, on-diagonal upper bounds imply precise off-diagonal Gaussian upper bounds for the kernels of analytic families of operators on metric measure spaces.
In this paper we construct pseudo random walks (symmetric and asymmetric) which converge in law to compositions of pseudoprocesses stopped at stable subordinators. We find the higher-order space-fractional heat-type equations whose…
Random walks on graphs are widely used in all sciences to describe a great variety of phenomena where dynamical random processes are affected by topology. In recent years, relevant mathematical results have been obtained in this field, and…
The lackadaisical quantum walk is a lazy version of a discrete-time, coined quantum walk, where each vertex has a weighted self-loop that permits the walker to stay put. They have been used to speed up spatial search on a variety of graphs,…
We study models of discrete-time, symmetric, $\Z^{d}$-valued random walks in random environments, driven by a field of i.i.d. random nearest-neighbor conductances $\omega_{xy}\in[0,1]$, with polynomial tail near 0 with exponent $\gamma>0$.…
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…