Related papers: Lamplighter random walks on fractals
Fractals are fascinating structures, not only for their aesthetic appeal, but also because they allow for the investigation of physical properties in non-integer dimensions. In these unconventional systems, a myriad of intrinsic features…
We consider random walks in a balanced i.i.d. random environment in $Z^d$ for $d\ge2$ and the corresponding discrete non-divergence form difference operators. We first obtain an exponential integrability of the heat kernel bounds. We then…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
We show that the circle packing embedding in $\mathbb{R}^2$ of a one-ended, planar triangulation with polynomial growth is quasisymmetric if and only if the simple random walk on the graph satisfies sub-Gaussian heat kernel estimate with…
We study random walks on metric spaces with contracting isometries. In this first article of the series, we establish sharp deviation inequalities by adapting Gou\"ezel's pivotal time construction. As an application, we establish 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…
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…
Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…
We consider the hierarchic tree Random Energy Model with continuous branching and calculate the moments of the corresponding partition function. We establish the multifractal properties of those moments. We derive formulas for the normal…
We consider the operator associated to a random walk on finite volume surfaces with hyperbolic cusps. We study the spectral gap (upper and lower bound) associated to this operator and deduce some rate of convergence of the iterated kernel…
This paper investigates random walks and diffusion limits on a broad class of fractal graphs generated by Edge Iterated Graph Systems (EIGS). We prove that the rescaled simple random walks converge in the…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We study the probability that a random walk started inside a subgraph of a larger graph exits that subgraph (or, equivalently, hits the exterior boundary of the subgraph). Considering the chance a random walk started in the subgraph never…
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in…
Recent progress on the understanding of the Random Conductance Model is reviewed. A particular emphasis is on homogenization results such as functional central limit theorems, local limit theorems and heat kernel estimates for almost every…
We suggest a theoretical scheme for the simulation of quantum random walks on a line using beam splitters, phase shifters and photodetectors. Our model enables us to simulate a quantum random walk with use of the wave nature of classical…
We prove diffusive lower bounds on the rate of escape of the random walk on infinite transitive graphs. Similar estimates hold for finite graphs, up to the relaxation time of the walk. Our approach uses nonconstant equivariant harmonic…
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…
Sub-Gaussian heat kernel estimates are typical of fractal graphs. We show that sub-Gaussian estimates on graphs follow from a Poincar\'e inequality, capacity upper bound, and a slow volume growth condition. An important feature of this work…