English
Related papers

Related papers: On outer fluctuations for internal DLA

200 papers

In this article, we consider a branching random walk on the real-line where displacements coming from the same parent have jointly regularly varying tails. The genealogical structure is assumed to be a supercritical Galton-Watson tree,…

Probability · Mathematics 2022-04-07 Ayan Bhattacharya

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

Data Structures and Algorithms · Computer Science 2024-09-17 Jingbang Chen , Mehrdad Ghadiri , Hoai-An Nguyen , Richard Peng , Junzhao Yang

This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to become active, while a jump to one of its neighbors depends…

Physics and Society · Physics 2020-01-29 Alfonso Allen-Perkins , Roberto F. S. Andrade

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

Probability · Mathematics 2007-05-23 Erwin Bolthausen , Christine Ritzmann

In this paper we establish Functional Limit Theorems for the range of random walks in $\mathbb{Z}^d$ that are in the domain of attraction of a non-degenerate $\beta$-stable process in the weakly transient and recurrent regimes. These…

Probability · Mathematics 2025-09-04 Maxence Baccara

We give a complete classification of scaling limits of randomly trapped random walks and associated clock processes on $\mathbb Z^d$, $d\ge 2$. Namely, under the hypothesis that the discrete skeleton of the randomly trapped random walk has…

Probability · Mathematics 2014-10-02 Jiří Černý , Tobias Wassmer

We identify the limit of the internal DLA cluster generated by Sinai's walk as the law of a functional of a Brownian motion which turns out to be a new interpretation of the Arcsine law.

Probability · Mathematics 2015-05-13 N. Enriquez , C. Lucas , F. Simenhaus

In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competition between repulsion of neighboring edges and attraction of…

Probability · Mathematics 2016-03-16 Daniel Kious

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

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

Probability · Mathematics 2010-02-10 Fabienne Castell , Nadine Guillotin-Plantard , Françoise Pène , Bruno Schapira

We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…

Probability · Mathematics 2017-11-15 Quentin Berger , Michele Salvi

The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set…

Condensed Matter · Physics 2007-05-23 Cristopher Moore , Jonathan Machta

We establish large deviations properties valid for almost every sample path of a class of stationary mixing processes $(X_1,..., X_n,...)$. These properties are inherited from those of $S_n=\sum_{i=1}^nX_i$ and describe how the local…

Probability · Mathematics 2011-12-08 Julien Barral , Patrick Loiseau

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

Probability · Mathematics 2012-05-03 Alan Hammond

The paper consists of two parts. In the first part we review recent work on limit theorems for random walks in random environment (RWRE) on a strip with jumps to the nearest layers. In the second part, we prove the quenched Local Limit…

Probability · Mathematics 2019-10-30 Dmitry Dolgopyat , Ilya Goldsheid

We study branching processes in an i.i.d. random environment, where the associated random walk is of the oscillating type. This class of processes generalizes the classical notion of criticality. The main properties of such branching…

Probability · Mathematics 2007-05-23 V. I. Afanasyev , J. Geiger , G. Kersting , V. A. Vatutin

We study how to sample paths of a random walk up to the first time it crosses a fixed barrier, in the setting where the step sizes are iid with negative mean and have a regularly varying right tail. We introduce a desirable property for a…

Probability · Mathematics 2018-11-16 Ton Dieker , Guido Lagos

The fluctuation theorem characterizes the distribution of the dissipation in nonequilibrium systems and proves that the average dissipation will be positive. For a large system with no external source of fluctuation, fluctuations in…

Statistical Mechanics · Physics 2018-12-18 Guillaume Michel , Debra J. Searles

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…

Probability · Mathematics 2007-12-06 Nobuo Yoshida

We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-18 Danupon Nanongkai , Atish Das Sarma , Gopal Pandurangan