中文
相关论文

相关论文: Maximal displacement of simple random walk bridge …

200 篇论文

We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical Galton--Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of…

概率论 · 数学 2015-02-11 Yueyun Hu , Zhan Shi

In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…

统计力学 · 物理学 2011-08-25 Zhongzhi Zhang , Xintong Li , Yuan Lin , Guanrong Chen

We derive an upper bound for the annealed return probability for the simple random walk on supercritical Bienaym\'e-Galton-Watson trees. The bound decays subexponentially in time $t$ with $t^{1/3}$ in the exponent. It is valid for all…

概率论 · 数学 2026-03-04 Markus Heydenreich , Peter Müller , Sara Terveer

Consider biased random walks on two Galton-Watson trees without leaves having progeny distributions $P_1$ and $P_2$ (GW$(P_1)$ and GW$(P_2)$) where $P_1$ and $P_2$ are supported on positive integers and $P_1$ dominates $P_2$ stochastically.…

概率论 · 数学 2015-06-12 Behzad Mehrdad , Sanchayan Sen , Lingjiong Zhu

We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…

概率论 · 数学 2014-09-08 Louigi Addario-Berry , Nicolas Broutin , Cecilia Holmgren

Consider a supercritical branching random walk on the real line. The consistent maximal displacement is the smallest of the distances between the trajectories followed by individuals at the $n$th generation and the boundary of the process.…

概率论 · 数学 2019-05-21 Bastien Mallein

We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with…

统计力学 · 物理学 2015-11-30 Satya N. Majumdar , Sanjib Sabhapandit , Gregory Schehr

In this paper, we consider the subcritical branching random walk in a random environment. We assume the branching and the step jump are independent; and the branching is in random envirenment, i.e., the particles in generation $n$ produce…

概率论 · 数学 2026-05-21 Fu Wenxin , Hong Wenming

Consider a branching random walk evolving in a macroscopic time-inhomogeneous environment, that scales with the length $n$ of the process under study. We compute the first two terms of the asymptotic of the maximal displacement at time $n$.…

概率论 · 数学 2018-10-01 Bastien Mallein

In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…

概率论 · 数学 2011-12-19 Pierre Andreoletti , Pierre Debs

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…

概率论 · 数学 2017-12-14 Romain Abraham , Jean-François Delmas

We consider a branching random walk on $\mathbb{Z}$ started by $n$ particles at the origin, where each particle disperses according to a mean-zero random walk with bounded support and reproduces with mean number of offspring $1+\theta/n$.…

概率论 · 数学 2021-03-09 Eyal Neuman , Xinghua Zheng

We study the distribution of the maximal displacement of particles positions for the whole time of the population existence in the model of critical and subcritical catalytic branching random walk on Z. In particular, we prove that in the…

概率论 · 数学 2020-07-14 Ekaterina Vl. Bulinskaya

It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with…

概率论 · 数学 2018-05-07 Anna Ben-Hamou , Eyal Lubetzky , Yuval Peres

We consider a branching random walk (BRW) taking its values in the $\mathtt{b}$-ary rooted tree $\mathbb W_{ \mathtt{b}}$ (i.e. the set of finite words written in the alphabet $\{ 1, \ldots, \mathtt{b} \}$, with $\mathtt{b}\! \geq \! 2$).…

概率论 · 数学 2022-01-24 Thomas Duquesne , Robin Khanfir , Shen Lin , Niccolo Torri

We consider a branching random walk on a multi($Q$)-type, supercritical Galton-Watson tree which satisfies Kesten-Stigum condition. We assume that the displacements associated with the particles of type $Q$ have regularly varying tails of…

概率论 · 数学 2019-09-25 Ayan Bhattacharya , Krishanu Maulik , Zbigniew Palmowski , Parthanil Roy

Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…

概率论 · 数学 2020-08-26 Cécile Mailler , Gerónimo Uribe Bravo

In this work, we consider a modification of the usual Branching Random Walk (BRW), where we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the $n$-th generation, which may be different…

概率论 · 数学 2025-02-18 Antar Bandyopadhyay , Partha Pratim Ghosh

We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…

概率论 · 数学 2014-04-16 Wei Su

We consider a null recurrent random walk $\mathbb{X}$ on a super-critical Galton Watson marked tree $\mathbb{T}$ in the (sub-)diffusive regime. We are interested in the asymptotic behaviour of the local time of its root at $n$, which is the…

概率论 · 数学 2023-12-27 Alexis Kagan