English
Related papers

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

200 papers

We consider random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. In a companion paper, we have shown that if the random walk is pulled to the right by a positive bias $\lambda > 0$, then…

Probability · Mathematics 2019-06-26 Nina Gantert , Matthias Meiners , Sebastian Müller

We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation…

Probability · Mathematics 2018-02-06 Marcus Michelen , Robin Pemantle , Josh Rosenberg

The statistics of equally weighted random paths (ideal polymer) is studied in $2$ and $3$ dimensional percolating clusters. This is equivalent to diffusion in the presence of a trapping environment. The number of $N$ step walks follows a…

Condensed Matter · Physics 2009-10-22 Achille Giacometti , Amos Maritan

We consider the simple random walk in i.i.d. nonnegative potentials on the multidimensional cubic lattice. Our goal is to investigate the cost paid by the simple random walk for traveling from the origin to a remote location in a landscape…

Probability · Mathematics 2016-03-21 Naoki Kubota

Let $G$ be a nonamenable transitive unimodular graph. In dynamical percolation, every edge in $G$ refreshes its status at rate $\mu>0$, and following the refresh, each edge is open independently with probability $p$. The random walk…

Probability · Mathematics 2024-07-23 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang

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

This paper studies the behavior of RWRE on trees in the critical case left open in previous work. For trees of exponential growth, a random perturbation of the transition probabilities can change a transient random walk into a recurrent…

Probability · Mathematics 2007-05-23 Robin Pemantle

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…

Probability · Mathematics 2017-06-20 Florian Sobieczky

We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…

Combinatorics · Mathematics 2019-02-11 Kiana Mittelstaedt

We consider random walks in a random environment that is given by i.i.d. Dirichlet distributions at each vertex of Z^d or, equivalently, oriented edge reinforced random walks on Z^d. The parameters of the distribution are a 2d-uplet of…

Probability · Mathematics 2013-09-20 Christophe Sabot , Laurent Tournier

We study self-avoiding walks on three-dimensional critical percolation clusters using a new exact enumeration method. It overcomes the exponential increase in computation time by exploiting the clusters' fractal nature. We enumerate walks…

Statistical Mechanics · Physics 2015-06-22 Niklas Fricke , Wolfhard Janke

We give a sufficient condition for the existence of the harmonic measure from infinity of transient random walks on weighted graphs. In particular, this condition is verified by the random conductance model on $\Z^d$, $d\geq 3$, when the…

Probability · Mathematics 2012-02-16 Daniel Boivin , Clément Rau

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

Probability · Mathematics 2016-06-14 Jonathon Peterson

We study a distinguished random walk on affine buildings of type Ar , which was already considered by Cartwright, Saloff-Coste and Woess. In rank r=2, it is the simple random walk and we obtain optimal global bounds for its transition…

Classical Analysis and ODEs · Mathematics 2023-12-05 Jean-Philippe Anker , Bruno Schapira , Bartosz Trojan

We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…

Probability · Mathematics 2020-06-11 Titus Lupu

We study the Incipient Infinite Cluster (IIC) of high-dimensional bond percolation on $\mathbb{Z}^d$. We prove that the mass dimension of IIC almost surely equals $4$ and the volume growth exponent of IIC almost surely equals $2$.

Probability · Mathematics 2014-05-30 Wouter Cames van Batenburg

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…

Probability · Mathematics 2025-10-28 Inhyeok Choi

Anomalous diffusion phenomena occur on length scales spanning from intracellular to astrophysical ranges. A specific form of decay at large argument of the probability density function of rescaled displacement (scaling function) is derived…

Statistical Mechanics · Physics 2023-05-23 Attilio L. Stella , Aleksei Chechkin , Gianluca Teza

We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…

Probability · Mathematics 2018-03-28 Cristian F. Coletti , R. J. Gava , Pablo M. Rodriguez

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

Probability · Mathematics 2020-05-20 Julien Petit , Renaud Lambiotte , Timoteo Carletti
‹ Prev 1 8 9 10 Next ›