中文
相关论文

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

200 篇论文

A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…

组合数学 · 数学 2009-11-07 T. H. Baker , P. J. Forrester

We consider one-dimensional discrete-time random walks (RWs) with arbitrary symmetric and continuous jump distributions $f(\eta)$, including the case of L\'evy flights. We study the expected maximum ${\mathbb E}[M_n]$ of bridge RWs, i.e.,…

统计力学 · 物理学 2021-08-30 Benjamin De Bruyne , Satya N. Majumdar , Gregory Schehr

We study a branching random walk with independent and identically distributed, heavy tailed displacements. The offspring law is supercritical and satisfies the Kesten-Stigum condition. We treat the case when the law of the displacements…

概率论 · 数学 2024-04-30 Ayan Bhattacharya , Piotr Dyszewski , Nina Gantert , Zbigniew Palmowski

Consider a random walk in random environment on a supercritical Galton--Watson tree, and let $\tau_n$ be the hitting time of generation $n$. The paper presents a large deviation principle for $\tau_n/n$, both in quenched and annealed cases.…

概率论 · 数学 2011-01-11 Elie Aidekon

In this note we consider both the local maximal out-degree and the global maximal out-degree of Galton-Watson trees. In particular, we show that the tail of any local maximal out-degree and that of the offspring distribution are…

概率论 · 数学 2015-03-10 Xin He

We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…

统计力学 · 物理学 2026-02-13 Satya N. Majumdar , Alberto Rosso

Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…

概率论 · 数学 2025-03-05 Víctor J. Maciá

Let $\mathbb{T}$ denote a rooted $b$-ary tree and let $\{S_v\}_{v\in \mathbb{T}}$ denote a branching random walk indexed by the vertices of the tree, where the increments are i.i.d. and possess a logarithmic moment generating function…

概率论 · 数学 2009-12-09 Ming Fang , Ofer Zeitouni

Starting from a unit mass on a vertex of a graph, we investigate the minimum number of "\emph{controlled diffusion}" steps needed to transport a constant mass $p$ outside of the ball of radius $n$. In a step of a controlled diffusion…

组合数学 · 数学 2017-03-30 Laura Florescu , Yuval Peres , Miklos Z. Racz

Let $\mathcal{T}$ be a supercritical Galton-Watson tree with a bounded offspring distribution that has mean $\mu >1$, conditioned to survive. Let $\varphi_{\mathcal{T}}$ be a random embedding of $\mathcal{T}$ into $\mathbb{Z}^d$ according…

概率论 · 数学 2019-03-14 Remco van der Hofstad , Tim Hulshof , Jan Nagel

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…

组合数学 · 数学 2007-05-23 P. J. Forrester

In this article, we study the maximal displacement in a branching random walk. We prove that its asymptotic behaviour consists in a first almost sure ballistic term, a negative logarithmic correction in probability and stochastically…

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

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

概率论 · 数学 2012-10-24 David Croydon

We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root. We prove that in the setting of multiplicative…

概率论 · 数学 2018-08-07 Andrea Collevecchio , Mark Holmes , Daniel Kious

We consider two-player combinatorial games in which the graph of positions is random and perhaps infinite, focusing on directed Galton-Watson trees. As the offspring distribution is varied, a game can undergo a phase transition, in which…

概率论 · 数学 2019-04-09 Alexander E. Holroyd , James B. Martin

We work on a Galton--Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the $n$-th level of the tree, as $n$ goes to infinity, by a mostly analytic…

概率论 · 数学 2023-04-27 Pierre Rousselin

Given a supercritical branching random walk $\{Z_n\}_{n\geq 0}$ on $\mathbb{R}$, let $Z_n([y,\infty))$ be the number of particles located in $[y,\infty)\subset\mathbb{R}$ at generation $n$. Let $m$ be the mean of the offspring law of…

概率论 · 数学 2024-02-07 Shuxiong Zhang , Lianghui Luo

Consider a branching random walk, where the branching mechanism is governed by a Galton-Watson process, and the migration by a finite range symmetric irreducible random walk on the integer lattice $\mathbb{Z}^d$. Let $Z_n(z)$ be the number…

概率论 · 数学 2021-06-09 Zhi-qiang Gao

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…

概率论 · 数学 2007-05-23 Jean-Francois Le Gall

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

概率论 · 数学 2024-12-11 Ion Grama , Sebastian Mentemeier , Hui Xiao