English
Related papers

Related papers: A localisation phase transition for the catalytic …

200 papers

We study a simple run-and-tumble random walk whose switching frequency from run mode to tumble mode and the reverse depend on a stochastic signal. We consider a particularly sharp, step-like dependence, where the run to tumble switching…

Cell Behavior · Quantitative Biology 2019-01-09 Subrata Dev , Sakuntala Chatterjee

We show that the critical density of the Activated Random Walk model on $\mathbb{Z}^d$ is strictly less than one when the sleep rate $\lambda$ is small enough, and tends to $0$ when $\lambda\to 0$, in any dimension $d\geqslant 1$. As far as…

Probability · Mathematics 2024-09-04 Nicolas Forien , Alexandre Gaudillière

Subcritical catalytic branching random walk on d-dimensional lattice is studied. New theorems concerning the asymptotic behavior of distributions of local particles numbers are established. To prove the results different approaches are used…

Probability · Mathematics 2013-10-29 Ekaterina Vl. Bulinskaya

Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…

Statistical Mechanics · Physics 2020-06-11 Timoteo Carletti , Malbor Asllani , Duccio Fanelli , Vito Latora

Localization phenomenon is an important research field in condensed matter physics. However, due to the complexity and subtlety of disordered syestems, new localization phenomena always emerge unexpectedly. For example, it is generally…

Disordered Systems and Neural Networks · Physics 2024-07-16 Tong Liu , Xingbo Wei , Youguo Wang

In this work, we study the large deviation properties of random walk in a random environment on $\mathbb{Z}^d$ with $d\geq1$. We start with the quenched case, take the point of view of the particle, and prove the large deviation principle…

Probability · Mathematics 2008-09-09 Atilla Yilmaz

We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…

Probability · Mathematics 2018-11-27 Amir Dembo , Ryoki Fukushima , Naoki Kubota

We consider Activated Random Walk (ARW), a particle system with mass conservation, on the cycle $\mathbb{Z}/n\mathbb{Z}$. One starts with a mass density $\mu>0$ of initially active particles, each of which performs a simple symmetric random…

Probability · Mathematics 2018-04-09 Riddhipratim Basu , Shirshendu Ganguly , Christopher Hoffman , Jacob Richey

We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…

Probability · Mathematics 2024-04-17 Julien Poisat , Francois Simenhaus

We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…

We consider a system of $N$ non-crossing Brownian particles in one dimension. We find the exact rate function that describes the long-time large deviation statistics of their occupation fraction in a finite interval in space. Remarkably, we…

Statistical Mechanics · Physics 2023-06-28 Soheli Mukherjee , Naftali R. Smith

Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in presence percolation and decoherence. We consider…

Quantum Physics · Physics 2018-09-12 Arkaprabha Ghosal , Prasenjit Deb

The intensely studied measurement-induced entanglement phase transition has become a hallmark of non-unitary quantum many-body dynamics. Usually, such a transition only shows up at the level of each individual quantum trajectory, and is…

Statistical Mechanics · Physics 2023-07-26 Vikram Ravindranath , Yiqiu Han , Zhi-Cheng Yang , Xiao Chen

Double (or parity conserving) branching annihilating random walk, introduced by Sudbury in '90, is a one-dimensional non-attractive particle system in which positive and negative particles perform nearest neighbor hopping, produce two…

Probability · Mathematics 2015-09-04 Márton Balázs , Attila László Nagy

We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…

Mathematical Physics · Physics 2026-02-16 Alain Joye , Andreas Schaefer , Simone Warzel

In this work we study a natural transition mechanism describing the passage from a quenched (almost sure) regime to an annealed (in average) one, for a symmetric simple random walk on random obstacles on sites having an identical and…

Probability · Mathematics 2016-08-16 Gérard Ben Arous , Stanislav Molchanov , Alejandro F. Ramírez

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

Probability · Mathematics 2019-03-05 Thomas Sauerwald , Luca Zanetti

We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…

Probability · Mathematics 2020-10-28 Marcelo R. Hilário , Daniel Kious , Augusto Teixeira

In recent years, the presence of local potentials has significantly enriched and diversified the entanglement patterns in monitored free fermion systems. In our approach, we employ the stochastic Schr\"odinger equation to simulate a…

Quantum Physics · Physics 2026-02-09 Yu-Jun Zhao , Xuyang Huang , Yi-Rui Zhang , Han-Ze Li , Jian-Xin Zhong

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

Data Structures and Algorithms · Computer Science 2021-02-16 Amartya Shankha Biswas , Edward Pyne , Ronitt Rubinfeld