English
Related papers

Related papers: Random walk on the incipient infinite cluster on t…

200 papers

We develop techniques to obtain rigorous bounds on the behaviour of random walks on combs. Using these bounds we calculate exactly the spectral dimension of random combs with infinite teeth at random positions or teeth with random but…

High Energy Physics - Theory · Physics 2009-11-11 Bergfinnur Durhuus , Thordur Jonsson , John Wheater

We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…

Probability · Mathematics 2007-10-12 Francis Comets , Francois Simenhaus

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

Probability · Mathematics 2018-11-20 Julien Brémont

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

Probability · Mathematics 2026-05-04 Tuan-Minh Nguyen

We investigate a self-interacting random walk, whose dynamically evolving environment is a random tree built by the walker itself, as it walks around. At time $n=1,2,\dots$, right before stepping, the walker adds a random number (possibly…

Probability · Mathematics 2023-11-10 János Engländer , Giulio Iacobelli , Rodrigo Ribeiro

The persistence probability, $P_C(t)$, of a cluster to remain unaggregated is studied in cluster-cluster aggregation, when the diffusion coefficient of a cluster depends on its size $s$ as $D(s) \sim s^\gamma$. In the mean-field the problem…

Statistical Mechanics · Physics 2009-11-07 E. K. O. Hellen , P. E. Salmi , M. J. Alava

It is shown that oriented random walk on the Heisenberg group admits exponential intersection tail. As a corollary we get that on any transitive graph of polynomial volume growth, which is not a finite extension of $\mathbb{Z},…

Probability · Mathematics 2022-02-04 Itai Benjamini , Oded Schramm

We analyse how simple local constraints in two dimensions lead a defect to exhibit robust, non-transient, and tunable, subdiffusion. We uncover a rich dynamical phenomenology realised in ice- and dimer-type models. On the microscopic scale…

Mesoscale and Nanoscale Physics · Physics 2025-04-02 Nilotpal Chakraborty , Markus Heyl , Roderich Moessner

We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…

Probability · Mathematics 2024-12-02 Amine Asselah , Bruno Schapira

Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett , Svante Janson

We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…

Plasma Physics · Physics 2009-11-07 H. Isliker , L. Vlahos

We consider a random walk among a Poisson cloud of moving traps on ${\mathbb Z}^d$, where the walk is killed at a rate proportional to the number of traps occupying the same position. In dimension $d=1$, we have previously shown that under…

Probability · Mathematics 2025-10-02 Siva Athreya , Alexander Drewitz , Rongfeng Sun

We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…

Probability · Mathematics 2012-10-24 David A. Croydon , Takashi Kumagai

In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…

Probability · Mathematics 2022-08-02 Eleanor Archer

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

Probability · Mathematics 2023-07-13 Ben Morris , Hamilton Samraj Santhakumar

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

Probability · Mathematics 2009-10-05 Lorenz A. Gilch , Sebastian Müller

We consider critical site percolation ($p=p_c=1/2$) on the triangular lattice $\mathbf{T}$ in two dimensions. We show that the simple random walk on the clusters of open vertices converges in the scaling limit to a continuous diffusion…

Probability · Mathematics 2026-04-16 Irina Đanković , Maarten Markering , Jason Miller , Yizheng Yuan

We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…

Probability · Mathematics 2014-12-18 Ron Rosenthal

We study invariant percolation processes on the d-regular tree that are obtained as a factor of an iid process. We show that the density of any factor of iid site percolation process with finite clusters is asymptotically at most (log d)/d…

Probability · Mathematics 2019-11-05 Mustazee Rahman

We study random walks on supercritical percolation clusters on wedges in $\Z^3$, and show that the infinite percolation cluster is (a.s.) transient whenever the wedge is transient. This solves a question raised by O. Haggstrom and E.…

Probability · Mathematics 2007-05-23 Omer Angel , Itai Benjamini , Noam Berger , Yuval Peres