English
Related papers

Related papers: Tightness for branching random walk in time-inhomo…

200 papers

Given a discrete-time non-lattice supercritical branching random walk in $\mathbb{R}^d$, we investigate its first passage time to a shifted unit ball of a distance $x$ from the origin, conditioned upon survival. We provide precise…

Probability · Mathematics 2026-04-10 Jose Blanchet , Zhenyuan Zhang

Given a super-critical branching random walk on $\mathbb R$ started from the origin, let $M_n$ be the maximal position of individuals at the $n$-th generation. Under some mild conditions, it is known from \cite{A13} that as…

Probability · Mathematics 2018-07-24 Xinxin Chen , Hui He

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties for the environment as seen from the position of the walker,…

Probability · Mathematics 2013-10-04 Frank Redig , Florian Völlering

We consider a $\mathbb{R}^d$-valued branching random walk with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. With the help of the…

Probability · Mathematics 2019-10-15 Chunmao Huang , Xin Wang , Xiaoqiang Wang

We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…

Probability · Mathematics 2010-11-16 Leonid Petrov

Let $\{S_n,n\geq 0\} $ be a random walk whose increments belong without centering to the domain of attraction of an $\alpha$-stable law $\{Y_t,t\geq 0\}$, i.e. $S_{nt}/a_n\Rightarrow Y_t,t\geq 0,$ for some scaling constants $a_n$. Assuming…

Probability · Mathematics 2023-03-15 Congzao Dong , Elena Dyakonova , Vladimir Vatutin

Given a branching random walk, let $M_n$ be the minimum position of any member of the $n$th generation. We calculate $\mathbf{E}M_n$ to within O(1) and prove exponential tail bounds for $\mathbf{P}\{|M_n-\mathbf{E}M_n|>x\}$, under quite…

Probability · Mathematics 2009-07-24 Louigi Addario-Berry , Bruce Reed

We study branching random walks in random environment on the $d$-dimensional square lattice, $d \geq 1$. In this model, the environment has finite range dependence, and the population size cannot decrease. We prove limit theorems (laws of…

Probability · Mathematics 2012-01-31 Francis Comets , Serguei Popov

We consider a continuous-time symmetric branching random walk on multidimensional lattices with immigration and infinite number of initial particles. We assume that at every lattice point a process of birth and death of particles is…

Probability · Mathematics 2020-02-11 Yu. Makarova , D. Han , S. Molchanov , E. Yarovaya

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

Probability · Mathematics 2016-12-28 Erich Baur

We consider a critical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We are interested in the event $\mathcal{A}_i(n)$ that all individuals alive at time $n$ are offspring of the…

Probability · Mathematics 2019-11-04 Charline Smadi , Vladimir A. Vatutin

We consider a branching particle system where each particle moves as an independent Brownian motion and breeds at a rate proportional to its distance from the origin raised to the power $p$, for $p\in[0,2)$. The asymptotic behaviour of the…

Probability · Mathematics 2014-02-24 Julien Berestycki , Éric Brunet , John W. Harris , Simon C. Harris , Matthew I. Roberts

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

Probability · Mathematics 2007-05-23 Francis Comets , Serguei Popov

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 study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…

Probability · Mathematics 2022-07-05 Souvik Ray , Rajat Subhra Hazra , Parthanil Roy , Philippe Soulier

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

Probability · Mathematics 2007-05-23 Robin Pemantle , Russell Lyons

We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We show a very strong form of intermittency, where with high probability most of the mass of the system is…

Probability · Mathematics 2016-05-02 Marcel Ortgiese , Matthew I. Roberts

Consider a branching random walk on $\mathbb Z$ in discrete time. Denote by $L_n(k)$ the number of particles at site $k\in\mathbb Z$ at time $n\in\mathbb N_0$. By the profile of the branching random walk (at time $n$) we mean the function…

Probability · Mathematics 2016-06-14 Rudolf Grübel , Zakhar Kabluchko

Given a branching random walk $(Z_n)_{n\geq0}$ on $\mathbb{R}$, let $Z_n(A)$ be the number of particles located in interval $A$ at generation $n$. It is well known (e.g., \cite{biggins}) that under some mild conditions, $Z_n(\sqrt…

Probability · Mathematics 2020-12-02 Shuxiong Zhang

We study the maximal displacement of a one dimensional subcritical branching random walk initiated by a single particle at the origin. For each $n\in\mathbb{N},$ let $M_{n}$ be the rightmost position reached by the branching random walk up…

Probability · Mathematics 2016-03-11 Eyal Neuman , Xinghua Zheng
‹ Prev 1 3 4 5 6 7 10 Next ›