English
Related papers

Related papers: On the fragmentation of a torus by random walk

200 papers

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

Statistical Mechanics · Physics 2021-09-27 Takashi Odagaki

This paper studies long range random walks on ${\mathbb{Z}_q}^d$. $X_{t+1} = X_t + Z_t \mod q$, with $(Z_t)$ independent and identically distributed. Multiple entries of $Z_t$ can be non-zero in a transition. An emphasis is on finding the…

Probability · Mathematics 2025-10-28 Robert Griffiths , Shuhei Mano

We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the…

Probability · Mathematics 2024-09-04 Guillaume Conchon--Kerjan , Daniel Kious , Pierre-François Rodriguez

Simple random walks on a partially directed version of $\mathbb{Z}^2$ are considered. More precisely, vertical edges between neighbouring vertices of $\mathbb{Z}^2$ can be traversed in both directions (they are undirected) while horizontal…

Probability · Mathematics 2014-01-31 Massimo Campanino , Dimitri Petritis

We consider the random walk of a particle in a two-dimensional self-affine random potential of Hurst exponent $H=1/2$ in the presence of an external force $F$. We present numerical results on the statistics of first-passage times that…

Disordered Systems and Neural Networks · Physics 2010-08-31 Cecile Monthus , Thomas Garel

In this note we study the geometry of the largest component C_1 of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. There it is shown that this component is of size n^{2/3}, and…

Probability · Mathematics 2009-11-17 Gady Kozma , Asaf Nachmias

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

Probability · Mathematics 2010-01-28 Nicholas Crawford , Allan Sly

We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…

Probability · Mathematics 2007-12-03 Iddo Ben-Ari , Mathieu Merle , Alexander Roitershtein

The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…

Statistical Mechanics · Physics 2007-05-23 L. Turban

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…

Probability · Mathematics 2014-10-29 Marek Biskup , Oren Louidor , Alex Rozinov , Alexander Vandenberg-Rodes

We consider a simple random walk on $\mathbb{Z}^d$ started at the origin and stopped on its first exit time from $(-L,L)^d \cap \mathbb{Z}^d$. Write $L$ in the form $L = m N$ with $m = m(N)$ and $N$ an integer going to infinity in such a…

Probability · Mathematics 2023-04-27 Antal A. Járai , Minwei Sun

A liquid droplet is fragmented by a sudden pressurized-gas blow, and the resulting droplets, adhered to the window of a flatbed scanner, are counted and sized by computerized means. The use of a scanner plus image recognition software…

Statistical Mechanics · Physics 2009-11-13 Cristian F. Moukarzel , Silvia F. Fernandez-Sabido , J. C. Ruiz-Suarez

We consider the branching capacity of the range of a simple random walk on $\mathbb Z^d$, with $d \ge 5$, and show that it falls in the same universality class as the volume and the capacity of the range of simple random walks and branching…

Probability · Mathematics 2023-04-03 Bruno Schapira

We consider the simple random walk on Z^d evolving in a potential of independent and identically distributed random variables taking values in [0, + \infty]. We give optimal conditions for the existence of the quenched point-to-point…

Probability · Mathematics 2012-03-27 Jean-Christophe Mourrat

Starting from a simple animal-biology example, a general, somewhat counter-intuitive property of diffusion random walks is presented. It is shown that for any (non-homogeneous) purely diffusing system, under any isotropic uniform incidence,…

Statistical Mechanics · Physics 2019-02-20 Stephane Blanco , Fournier Richard

Discrete quantum walks are dynamical protocols for controlling a single quantum particle. Despite of its simplicity, quantum walks display rich topological phenomena and provide one of the simplest systems to study and understand…

Quantum Physics · Physics 2011-12-09 Takuya Kitagawa

Let ${\cal G}$ be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree $n_0+1$. We obtain estimates for the transition density of the continuous time simple random walk $Y$ on ${\cal G}$; the process…

Probability · Mathematics 2007-05-23 Martin T. Barlow , Takashi Kumagai

We introduce the notion of topological electronic states on random lattices in non-integer dimensions. By considering a class $D$ model on critical percolation clusters embedded in two dimensions, we demonstrate that these topological…

Mesoscale and Nanoscale Physics · Physics 2022-12-15 Moein N. Ivaki , Isac Sahlberg , Kim Pöyhönen , Teemu Ojanen

It has recently been shown that networks possessing scale-free and fractal properties may exhibit a bifractal nature, in which local structures are described by two different fractal dimensions. In this study, we investigate random walks on…

Physics and Society · Physics 2024-12-30 Kousuke Yakubo , Gentaro Shimojo , Jun Yamamoto

The even discrete torus is the graph T_{L,d} on vertex set {0,...,L-1}^d (L even) with two vertices adjacent if they differ by 1 (mod L) on one coordinate. The hard-core measure with activity x on T_{L,d} is the distribution pi_x on the…

Combinatorics · Mathematics 2010-07-29 David Galvin