English
Related papers

Related papers: Oriented Random Walk on the Heisenberg Group and P…

200 papers

Let $(G,\mu)$ be a uniformly elliptic random conductance graph on $\mathbb{Z}^d$ with a Poisson point process of particles at time $t=0$ that perform independent simple random walks. We show that inside a cube $Q_K$ of side length $K$, if…

Probability · Mathematics 2019-04-02 Peter Gracar , Alexandre Stauffer

Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. In this paper we solve…

Probability · Mathematics 2009-03-10 Dayue Chen , Yuval Peres , Gabor Pete

In this paper we prove that, under the assumption of quasi-transitivity, if a branching random walk on ${{\mathbb{Z}}^d}$ survives locally (at arbitrarily large times there are individuals alive at the origin), then so does the same process…

Probability · Mathematics 2015-06-22 Daniela Bertacchi , Fabio Zucca

We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary…

Probability · Mathematics 2019-09-12 Matthias Birkner , Nina Gantert , Sebastian Steiber

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

Probability · Mathematics 2024-03-13 Philip Easo

We introduce a general model of trapping for random walks on graphs. We give the possible scaling limits of these Randomly Trapped Random Walks on $\mathbb {Z}$. These scaling limits include the well-known fractional kinetics process, the…

Probability · Mathematics 2015-10-30 Gérard Ben Arous , Manuel Cabezas , Jiří Černý , Roman Royfman

We show that simple random walks on (non-trivial) relatively hyperbolic groups stay $O(\log(n))$-close to geodesics, where $n$ is the number of steps of the walk. Using similar techniques we show that simple random walks in mapping class…

Group Theory · Mathematics 2013-05-24 Alessandro Sisto

The scaling of the tails of the probability of a system to percolate only in the horizontal direction $\pi_{hs}$ was investigated numerically for correlated site-bond percolation model for $q=1,2,3,4$.We have to demonstrate that the tails…

Statistical Mechanics · Physics 2009-11-10 Oleg A. Vasilyev

Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probability that the cluster of the origin is finite but has a large…

Probability · Mathematics 2021-01-26 Gábor Pete , Ádám Timár

We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infinite planar triangulation and quadrangulation…

Probability · Mathematics 2012-06-05 Ori Gurel-Gurevich , Asaf Nachmias

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

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey

The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk…

Probability · Mathematics 2010-09-06 Itai Benjamini , Gady Kozma , Bruno Schapira

In this article, we consider random walk on the infinite cluster of bond percolation on $\Z^d (d \geq 2)$. We show that the Laplace transformation of the number of visited points $N\_n$, has a behaviour as the random walk was on $\Z^d$.…

Probability · Mathematics 2007-05-23 Clement Rau

A random walk $w_n$ on a separable, geodesic hyperbolic metric space $X$ converges to the boundary $\partial X$ with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes…

Geometric Topology · Mathematics 2021-01-22 Matt Sunderland

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

Probability · Mathematics 2020-10-06 Jonathan Hermon , Tom Hutchcroft

We show that random walk on a stationary random graph with positive anchored expansion and exponential volume growth has positive speed. We also show that two families of random triangulations of the hyperbolic plane, the hyperbolic Poisson…

Probability · Mathematics 2014-11-03 Itai Benjamini , Elliot Paquette , Joshua Pfeffer

Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…

Probability · Mathematics 2007-05-23 Massimo Campanino , Dimitri Petritis

We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…

Probability · Mathematics 2024-09-26 Sebastian Andres , Nina Gantert , Dominik Schmid , Perla Sousi

We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…

Probability · Mathematics 2013-10-18 Alexander Fribergh , Alan Hammond
‹ Prev 1 3 4 5 6 7 10 Next ›