English
Related papers

Related papers: A Lower Bound on the Growth Exponent for Loop-Eras…

200 papers

We generalize the diffusion-limited aggregation by issuing many randomly-walking particles, which stick to a cluster at the discrete time unit providing its growth. Using simple combinatorial arguments we determine probabilities of…

Statistical Mechanics · Physics 2017-05-24 Oleg Alekseev , Mark Mineev-Weinstein

Sharp estimates for the length of loop erased random walk between two vertices on the [n]^d -torus, d > 4, are established. The mean length is order n^{d/2} . In dimension 4 we have only an upper bound.

Probability · Mathematics 2007-05-23 Itai Benjamini , Gady Kozma

We establish both the $\limsup$ and the $\liminf$ law of the iterated logarithm (LIL), for the capacity of the range of a simple random walk in any dimension $d\ge 3$. While for $d \ge 4$, the order of growth in $n$ of such LIL at dimension…

Probability · Mathematics 2024-03-05 Amir Dembo , Izumi Okada

We consider a random walk in random environment in the low disorder regime on $\mathbb Z^d$. That is, the probability that the random walk jumps from a site $x$ to a nearest neighboring site $x+e$ is given by $p(e)+\epsilon \xi(x,e)$, where…

Probability · Mathematics 2015-11-11 David Campos , Alejandro F. Ramirez

We describe the scaling limit of the nearest neighbour prudent walk on the square lattice, which performs steps uniformly in directions in which it does not see sites already visited. We show that the scaling limit is given by the process…

Probability · Mathematics 2018-04-26 V. Beffara , S. Friedli , Y. Velenik

We study statistics of first passage inside a cone in arbitrary spatial dimension. The probability that a diffusing particle avoids the cone boundary decays algebraically with time. The decay exponent depends on two variables: the opening…

Statistical Mechanics · Physics 2010-11-19 E. Ben-Naim , P. L. Krapivsky

We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…

Probability · Mathematics 2018-03-29 Volker Betz , Lorenzo Taggi

We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…

We study a one-dimensional lattice random walk with an absorbing boundary at the origin and a movable partial reflector. On encountering the reflector, at site x, the walker is reflected (with probability r) to x-1 and the reflector is…

Statistical Mechanics · Physics 2009-11-07 Ronald Dickman , Daniel ben-Avraham

In this paper, we deal with the inner boundary of random walk range, that is, the set of those points in a random walk range which have at least one neighbor site outside the range. If $L_n$ be the number of the inner boundary points of…

Probability · Mathematics 2014-12-25 Izumi Okada

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. This model is known to exhibit a phase transition: If $d \ge 3$ and the environment is "not too random", then, the total…

Probability · Mathematics 2007-12-06 Yueyun Hu , Nobuo Yoshida

We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…

Probability · Mathematics 2021-07-15 T. J. van Uem

The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We prove that the asymptotic shape of this model is a Euclidean ball, in a sense which is…

Probability · Mathematics 2009-12-05 Lionel Levine , Yuval Peres

We have produced extended series for two-dimensional prudent polygons, based on a transfer matrix algorithm of complexity O$(n^5),$ for a series of length $n.$ We have extended the definition to three dimensions and produced series…

Statistical Mechanics · Physics 2008-10-20 John C. Dethridge , Timothy M. Garoni , Anthony J. Guttmann , Iwan Jensen

We study the limiting behaviors of a generalized elephant random walk on the integer lattice. This random walk is defined by using two sequences of parameters expressing the memory at each step from the whole past and the drift of each step…

Probability · Mathematics 2022-12-08 Yuichi Shiozawa

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…

Probability · Mathematics 2023-02-14 E. Filichkina , E. Yarovaya

We introduce range-controlled random walks with hopping rates depending on the range $\mathcal{N}$, that is, the total number of previously distinct visited sites. We analyze a one-parameter class of models with a hopping rate…

Statistical Mechanics · Physics 2023-10-16 L. Régnier , O. Bénichou , P. L. Krapivsky

We study a Brownian motion with drift in a wedge of angle $\beta$ which is obliquely reflected on each edge along angles $\varepsilon$ and $\delta$. We assume that the classical parameter $\alpha=\frac{\delta+\varepsilon - \pi}{\beta}$ is…

Probability · Mathematics 2024-09-30 Jules Flin , Sandro Franceschi

In this note, we compute the probability that a two-dimensional symmetric random walk visits more vertices than expected, for deviations on scales between the mean behavior and linear growth.

Probability · Mathematics 2026-02-26 Serguei Popov , Quirin Vogel

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

Dynamical Systems · Mathematics 2015-08-17 Péter Pál Varjú