English
Related papers

Related papers: Exponential and Laplace approximation for occupati…

200 papers

In this work, we consider the scaling limit of loop-erased random walk (LERW) in three dimensions and prove that the limiting occupation measure is equivalent to its $\beta$-dimensional Minkowski content, where $\beta \in (1, 5/3]$ is its…

Probability · Mathematics 2025-12-23 Sarai Hernandez-Torres , Xinyi Li , Daisuke Shiraishi

We consider a particle moving in a one dimensional potential which has a symmetric deterministic part and a quenched random part. We study analytically the probability distributions of the local time (spent by the particle around its mean…

Statistical Mechanics · Physics 2009-11-07 Satya N. Majumdar , Alain Comtet

Let $\{Z_{m},m\geq 0\}$ be a critical branching process in random environment and $\{S_{m},m\geq 0\}$ be its associated random walk. Assuming that the increments distribution of the associated random walk belongs without centering to the…

Probability · Mathematics 2025-12-30 Vladimir Vatutin , Elena Dyakonova

We investigate the impact of Allee effect and dispersal on the long-term evolution of a population in a patchy environment, focusing on whether a population already established in one patch either successfully invades an adjacent empty…

Classical Analysis and ODEs · Mathematics 2010-03-02 Yun Kang , Nicolas Lanchier

In this paper we consider a null recurrent random walk in random environment on a super-critical Galton-Watson tree. We consider the case where the log-Laplace transform $\psi$ of the branching process satisfies $\psi(1)=\psi'(1)=0$ for…

Probability · Mathematics 2014-02-14 Pierre Andreoletti , Pierre Debs

Let $\{Z_n\}_{n\geq 0 }$ be a $d$-dimensional supercritical branching random walk started from the origin. Write $Z_n(S)$ for the number of particles located in a set $S\subset\mathbb{R}^d$ at time $n$. Denote by…

Probability · Mathematics 2023-07-19 Shuxiong Zhang

Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…

Computational Complexity · Computer Science 2021-11-04 Edward Pyne , Salil Vadhan

We show that the range of a critical branching random walk conditioned to survive forever and the Minkowski sum of two independent simple random walk ranges are intersection-equivalent in any dimension $d\ge 5$, in the sense that they hit…

Probability · Mathematics 2023-08-25 Amine Asselah , Izumi Okada , Bruno Schapira , Perla Sousi

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

Probability · Mathematics 2017-05-12 Eviatar B. Procaccia , Yuan Zhang

A random walk starts from the origin of a d-dimensional lattice. The occupation number n(x,t) equals unity if after t steps site x has been visited by the walk, and zero otherwise. We study translationally invariant sums M(t) of observables…

Statistical Mechanics · Physics 2009-10-28 F. van Wijland , H. J. Hilhorst

We study the limiting occupation density process for a large number of critical and driftless branching random walks. We show that the rescaled occupation densities of $\lfloor sN\rfloor$ branching random walks, viewed as a function-valued,…

Probability · Mathematics 2020-03-16 Si Tang , Steven P. Lalley

Branching processes $(Z_n)_{n \ge 0}$ in a varying environment generalize the Galton-Watson process, in that they allow time-dependence of the offspring distribution. Our main results concern general criteria for a.s. extinction,…

Probability · Mathematics 2019-11-11 Götz Kersting

Internal DLA (IDLA) is an internal aggregation model in which particles perform random walks from the origin, in turn, and stop upon reaching an unoccupied site. Levine and Peres showed that, when particles start instead from fixed…

Probability · Mathematics 2022-01-24 David Darrow

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

Probability · Mathematics 2013-07-22 Jean-François Le Gall , Shen Lin

Consider a supercritical branching random walk in a time-inhomogeneous random environment. We impose a selection (called barrier) on survival in the following way. The position of the barrier may depend on the generation and the…

Probability · Mathematics 2024-07-02 You Lv

We establish a general sufficient condition for a sequence of Galton Watson branching processes in varying environment to converge weakly. This condition extends previous results by allowing offspring distributions to have infinite…

Probability · Mathematics 2014-09-22 Vincent Bansaye , Florian Simatos

We study a discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice. Each particle produces a Poissonian number of offspring with mean $\mu$ which independently move to a uniformly chosen site within a fixed…

Probability · Mathematics 2024-04-25 Matthias Birkner , Alice Callegaro , Jiří Černý , Nina Gantert , Pascal Oswald

Heterogeneities in environmental conditions often induce corresponding heterogeneities in the distribution of species. In the extreme case of a localized patch of increased growth rates, reproducing populations can become strongly…

Populations and Evolution · Quantitative Biology 2013-01-17 Lukas Geyrhofer , Oskar Hallatschek

We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…

Probability · Mathematics 2020-05-12 Christian Beneš

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

Probability · Mathematics 2012-10-24 David A. Croydon