Related papers: Lamplighter random walks on fractals

In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…

We consider the asymptotics of the discrete heat kernel on isoradial graphs for the case where the time and the edge lengths tend to zero simultaneously. Depending on the asymptotic ratio between time and edge lengths, we show that two…

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…

In this paper, we discuss several explicit examples of the results obtained in JHEP 1402 (2014) 127. We elaborate on the random walk picture in these spacetimes and how it is modified. Firstly we discuss the linear dilaton background. Then…

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…

A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…

Let $G$ be a finitely generated group and $X$ its Cayley graph with respect to a finite, symmetric generating set $S$. Furthermore, let $H$ be a finite group and $H \wr G$ the lamplighter group (wreath product) over $G$ with group of…

We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…

This paper states a law of large numbers for a random walk in a random iid environment on ${\mathbb Z}^d$, where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the…

We introduce an alternative thermal diffusive dynamics for the spin-S Ising ferromagnet realized by means of a random walker. The latter hops across the sites of the lattice and flips the relevant spins according to a probability depending…

We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…

Graphs on lattice points are studied whose edges come from a finite set of allowed moves of arbitrary length. We show that the diameter of these graphs on fibers of a fixed integer matrix can be bounded from above by a constant. We then…

We prove that sub-Gaussian heat kernel estimates are inherited from a diffusion process on the ambient space to the reflected diffusion process on a subset which is an inner uniform domain.

Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…

Suppose that $\CG$ is a finite, connected graph and $X$ is a lazy random walk on $\CG$. The lamplighter chain $X^\diamond$ associated with $X$ is the random walk on the wreath product $\CG^\diamond = \Z_2 \wr \CG$, the graph whose vertices…

We study the random conductance model on $\mathbb{Z}^d$ with ergodic, unbounded conductances. We prove a Gaussian lower bound on the heat kernel given a polynomial moment condition and some additional assumptions on the correlations of the…

Recently, we initiated the study of random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that each vertex is labeled upon its first visit. In this work, we calculate…

We consider the range of the simple random walk on graphs with spectral dimension two. We give a form of strong law of large numbers under a certain uniform condition, which is satisfied by not only the square integer lattice but also a…

In this article we study the energy level spectrum of fractals which have block-hierarchical structures. We develop a method to study the spectral properties in terms of linearization of spectral decimation procedure and verify it…