Related papers: Lamplighter random walks on fractals
We consider random walks on $\Z^d$ among nearest-neighbor random conductances which are i.i.d., positive, bounded uniformly from above but whose support extends all the way to zero. Our focus is on the detailed properties of the paths of…
Several well-known results from the random matrix theory, such as Wigner's law and the Marchenko--Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the…
It is shown how to construct quantum random walks with particles in an arbitrary faithful normal state. A convergence theorem is obtained for such walks, which demonstrates a thermalisation effect: the limit cocycle obeys a quantum…
We obtain the optimal global upper and lower bounds for the transition density $p_n(x,y)$ of a finite range isotropic random walk on affine buildings. We present also sharp estimates for the corresponding Green function.
We establish two-sided heat kernel estimates for random conductance models with non-uniformly elliptic (possibly degenerate) stable-like jumps on graphs. These are long range counterparts of well known two-sided Gaussian heat kernel…
In this paper, we investigate the crossing statistics of speckle patterns formed in Fresnel diffraction region by a laser beam scattering through a nanofluid. We extend $zero-crossing$ statistics to assess dynamical properties of nanofluid.…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
We consider random walks among random conductances on $\mathbb{Z}^2$ and establish precise asymptotics for the associated potential kernel and the Green's function of the walk killed upon exiting balls. The result is proven for random walks…
We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…
We consider the 1D motion of an overdamped Brownian particle in a general potential in the low temperature limit. We derive an explicit expression for the probability distribution for the heat transferred to the particle. We find that the…
We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs…
We derive the sharp return-probability asymptotic for the switch--walk--switch lamplighter walk with lamp group $\mathbb Z_2$ over the infinite $d$-regular tree: \[ p_{2n}(e,e) = \rho_d^{2n} \exp\left[ -\left(\pi^2(\log(d-1))^2+o(1)\right)…
We consider homogeneous open quantum random walks on a lattice with finite dimensional local Hilbert space and we study in particular the position process of the quantum trajectories of the walk. We prove that the properly rescaled position…
This paper develops an adaptive version of Mallat's scattering transform for signals on graphs. The main results are norm bounds for the layers of the transform, obtained from a version of a Beurling-Deny inequality that permits to remove…
This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to become active, while a jump to one of its neighbors depends…
Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is a reversible ergodic Markov chain on H. The generalized lamplighter chain X* associated with X and Z is the random walk on the wreath…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…