English
Related papers

Related papers: Lamplighter random walks on fractals

200 papers

For incomplete sub-Riemannian manifolds, and for an associated second-order hypoelliptic operator, which need not be symmetric, we identify two alternative conditions for the validity of Gaussian-type upper bounds on heat kernels and…

Probability · Mathematics 2022-03-23 Ismael Bailleul , James Norris

The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…

Quantum Physics · Physics 2009-11-13 Kai Zhang

We consider the open quantum random walks on the crystal lattices and investigate the central limit theorems for the walks. On the integer lattices the open quantum random walks satisfy the central limit theorems as was shown by Attal, {\it…

Mathematical Physics · Physics 2019-06-26 Chul Ki Ko , Norio Konno , Etsuo Segawa , Hyun Jae Yoo

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

Computational Complexity · Computer Science 2016-06-07 Tali Kaufman , David Mass

We study the inverse problem of determining a finite weighted graph $(X,E)$ from the source-to-solution map on a vertex subset $B\subset X$ for heat equations on graphs, where the time variable can be either discrete or continuous. We prove…

Spectral Theory · Mathematics 2023-01-05 Emilia Blåsten , Hiroshi Isozaki , Matti Lassas , Jinpeng Lu

We study heat semigroups generated by self-adjoint Laplace operators on metric graphs characterized by the property that the local scattering matrices associated with each vertex of the graph are independent from the spectral parameter. For…

Mathematical Physics · Physics 2008-02-05 Vadim Kostrykin , Jurgen Potthoff , Robert Schrader

Quantum random walk in a two-dimensional lattice with randomly distributed traps is investigated. Distributions of quantum walkers are evaluated dynamically for the cases of Hadamard, Fourier, and Grover coins, and quantum to classical…

Quantum Physics · Physics 2009-09-09 Meltem Gonulol , Ekrem Aydiner , Ozgur E. Mustecaplioglu

We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate \mu\ while at the same time a random walker moves on G at rate 1 but only along…

Probability · Mathematics 2013-08-29 Yuval Peres , Alexandre Stauffer , Jeffrey E. Steif

The field- and temperature-dependent de Haas-van Alphen oscillations spectrum is studied for an ideal two-dimensional compensated metal whose Fermi surface is made of a linear chain of successive orbits with electron and hole character,…

Strongly Correlated Electrons · Physics 2015-05-13 Jean-Yves Fortin , Alain Audouard

We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point…

Quantum Physics · Physics 2007-05-23 Dmitry Solenov , Leonid Fedichkin

We analyze the heat kernel associated to the Laplacian on a compact metric graph, with standard Kirchoff-Neumann vertex conditions. An explicit formula for the heat kernel as a sum over loops, developed by Roth and Kostrykin, Potthoff, and…

Spectral Theory · Mathematics 2023-05-10 David Borthwick , Kenny Jones , Evans M. Harrell

In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…

Probability · Mathematics 2024-03-25 Steffen Dereich

We consider the random walk on supercritical percolation clusters in the d-dimensional Euclidean lattice. Previous papers have obtained Gaussian heat kernel bounds, and a.s. invariance principles for this process. We show how this…

Probability · Mathematics 2008-10-15 Martin Barlow , Ben Hambly

We consider a random walk on a random graph $(V,E)$, where $V$ is the set of open sites under i.i.d. Bernoulli site percolation on the multi-dimensional integer set $\mathbf{Z}^d$, and the transition probabilities of the walk are generated…

Probability · Mathematics 2016-05-18 Zhang Zhongyang , Zhang Li-Xin

We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…

Probability · Mathematics 2025-11-10 Anuraag Kumar

We study the distribution of sizes of erased loops for loop-erased random walks on regular and fractal lattices. We show that for arbitrary graphs the probability $P(l)$ of generating a loop of perimeter $l$ is expressible in terms of the…

Statistical Mechanics · Physics 2009-10-30 Deepak Dhar , Abhishek Dhar

Properties of random and fluctuating systems are often studied through the use of Gaussian distributions. However, in a number of situations, rare events have drastic consequences, which can not be explained by Gaussian statistics.…

Atomic Physics · Physics 2015-05-13 Nicolas Mercadier , William Guerin , Martine Chevrollier , Robin Kaiser

This paper studies by means of standard analytic tools the small time behavior of the heat content over a bounded Lebesgue measurable set of finite perimeter by working with the set covariance function and by imposing conditions on the heat…

Probability · Mathematics 2016-03-25 Luis Acuna Valverde

We introduce a model of a quantum walk on a graph in which a particle jumps between neighboring nodes and interacts with independent spins sitting on the edges. Entanglement propagates with the walker. We apply this model to the case of a…

Quantum Physics · Physics 2021-03-30 Kevissen Sellapillay , Alberto D. Verga

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

Combinatorics · Mathematics 2007-05-23 Bernhard Krön , Elmar Teufl