English
Related papers

Related papers: Simple Random Walk on Long Range Percolation Clust…

200 papers

Let $S$ be the random walk obtained from "coin turning" with some sequence $\{p_n\}_{n\ge 1}$, as introduced in [6]. In this paper we investigate the scaling limits of $S$ in the spirit of the classical Donsker invariance principle, both…

Probability · Mathematics 2019-10-08 Janos Englander , Stanislav Volkov , Zhenhua Wang

It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…

Probability · Mathematics 2010-02-10 Federico Camia , Matthijs Joosten , Ronald Meester

We consider biased random walk on supercritical percolation clusters in $\Z^2$. We show that the random walk is transient and that there are two speed regimes: If the bias is large enough, the random walk has speed zero, while if the bias…

Probability · Mathematics 2007-05-23 Noam Berger , Nina Gantert , Yuval Peres

We consider the limit behavior of a one-dimensional random walk with unit jumps whose transition probabilities are modified every time the walk hits zero. The invariance principle is proved in the scheme of series where the size of…

Probability · Mathematics 2016-11-08 Andrey Pilipenko , Vladislav Khomenko

We prove that, after centering and diffusively rescaling space and time, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2_{even}:={(x,i) in Z^2: x+i is even}…

Probability · Mathematics 2013-02-06 Anish Sarkar , Rongfeng Sun

We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…

Probability · Mathematics 2020-07-13 Tatsuya Miyazaki , Masato Takei

In long-range percolation on $\mathbb{Z}^d$, points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta \geq 0$ is a parameter. As $d$ and $\alpha$ vary, the model…

Probability · Mathematics 2025-08-27 Tom Hutchcroft

We consider $Z^d$, with d bigger or equal to three. We investigate the vacant set of random interlacements in the strongly percolative regime, the vacant set of the simple random walk, and the excursion set above a given level of the…

Probability · Mathematics 2019-07-08 Alain-Sol Sznitman

Biggins [Uniform convergence of martingales in the branching random walk. {\em Ann. Probab.}, 20(1):137--151, 1992] proved local uniform convergence of additive martingales in $d$-dimensional supercritical branching random walks at complex…

Probability · Mathematics 2016-11-17 Konrad Kolesko , Matthias Meiners

We study a random walk on a point process given by an ordered array of points $(\omega_k, \, k \in \mathbb{Z})$ on the real line. The distances $\omega_{k+1} - \omega_k$ are i.i.d. random variables in the domain of attraction of a…

Probability · Mathematics 2021-05-05 Samuele Stivanello , Gianmarco Bet , Alessandra Bianchi , Marco Lenci , Elena Magnanini

There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint…

Probability · Mathematics 2007-05-23 Yuval Peres

We establish general estimates for simple random walk on an arbitrary infinite random graph, assuming suitable bounds on volume and effective resistance for the graph. These are generalizations of the results in \cite[Section 1,2]{BJKS},…

Probability · Mathematics 2008-08-01 Takashi Kumagai , Jun Misumi

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…

Probability · Mathematics 2018-11-06 Jian Ding , Changji Xu

The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…

Statistical Mechanics · Physics 2009-11-13 C. Anteneodo , W. A. M. Morgado

One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…

Statistical Mechanics · Physics 2016-03-23 Rüdiger Kürsten

We consider dynamical percolation on the $d$-dimensional discrete torus of side length $n$, $\mathbb{Z}_n^d$, where each edge refreshes its status at rate $\mu=\mu_n\le 1/2$ to be open with probability $p$. We study random walk on the…

Probability · Mathematics 2017-07-25 Yuval Peres , Perla Sousi , Jeffrey E. Steif

The random walk loop soup is a Poissonian ensemble of lattice loops; it has been extensively studied because of its connections to the discrete Gaussian free field, but was originally introduced by Lawler and Trujillo Ferreras as a discrete…

Probability · Mathematics 2016-09-19 Tim van de Brug , Federico Camia , Marcin Lis

This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed…

Probability · Mathematics 2021-09-29 Jim Pitman , Wenpin Tang

We study the motion of a random walker in one longitudinal and d transverse dimensions with a quenched power law correlated velocity field in the longitudinal x-direction. The model is a modification of the Matheron-de Marsily (MdM) model,…

Statistical Mechanics · Physics 2007-05-23 Soumen Roy , Dibyendu Das

We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…

Probability · Mathematics 2019-01-01 Jon Chaika , Arjun Krishnan
‹ Prev 1 8 9 10 Next ›