中文
相关论文

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

200 篇论文

We continue our study of the distribution of the maximal number $X^{\ast}_k$ of offsprings amongst all individuals in a critical Galton-Watson process started with $k$ ancestors, treating the case when the reproduction law has a regularly…

概率论 · 数学 2012-09-19 Jean Bertoin

Consider a random walk on a tree $G=(V,E)$. For $v,w \in V$, let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at $v$ to reach $w$, and let $\pi_v = \mathrm{deg}(v)/2|E|$ denote the…

组合数学 · 数学 2025-08-06 Andrew Beveridge , Ben Bridenbaugh , Ari Holcombe Pomerance

We study a particular type of subcritical Galton--Watson trees, which are called non-generic trees in the physics community. In contrast with the critical or supercritical case, it is known that condensation appears in certain large…

概率论 · 数学 2018-02-19 Igor Kortchemski

In this paper we consider inhomogeneous Galton-Watson trees, and derive various moments for such processes: the number of vertices, the number of leaves, and the height of the tree. Also we make a simple condition of finiteness. We use…

应用统计 · 统计学 2025-05-09 Jakob G. Rasmussen , Troels Pedersen , Rasmus L. Olsen

We compute exact values respectively bounds of "distances" - in the sense of (transforms of) power divergences and relative entropy - between two discrete-time Galton-Watson branching processes with immigration GWI for which the offspring…

概率论 · 数学 2022-10-21 Niels B. Kammerer , Wolfgang Stummer

We revisit the problem of Brownian diffusion with drift in order to study finite-size effects in the geometric Galton-Watson branching process. This is possible because of an exact mapping between one-dimensional random walks and geometric…

统计力学 · 物理学 2018-07-04 Alvaro Corral , Rosalba Garcia-Millan , Nicholas R. Moloney , Francesc Font-Clos

We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…

概率论 · 数学 2007-05-23 Martin T. Barlow

We study random walks on $\mathbb{Z}$ which have a linear (or almost linear) drift towards 0 in a range around 0. This drift leads to a metastable Gaussian distribution centered at zero. We give specific, fast growing, time windows where we…

概率论 · 数学 2023-07-18 O. S. Awolude , E. Cator , H. Don

Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the…

概率论 · 数学 2025-09-30 George Andriopoulos

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…

概率论 · 数学 2017-09-28 Romain Abraham , Aymen Bouaziz , Jean-François Delmas

Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…

概率论 · 数学 2025-09-03 Gabriel Berzunza Ojeda , Cecilia Holmgren

We consider the random walk Metropolis algorithm on $\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. In the limit $n\to\infty$, it is well known (see [Ann.…

概率论 · 数学 2016-08-14 Benjamin Jourdain , Tony Lelièvre , Błażej Miasojedow

We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…

概率论 · 数学 2025-03-30 Manuel Cabezas , Alexander Fribergh , Mark Holmes , Edwin Perkins

We study random typical minimal factorizations of the $n$-cycle, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions, chosen uniformly at random. Our main result is, roughly speaking, a local convergence theorem…

概率论 · 数学 2019-05-06 Valentin Féray , Igor Kortchemski

We study the probability distribution $P(X_N=X,N)$ of the total displacement $X_N$ of an $N$-step run and tumble particle on a line, in presence of a constant nonzero drive $E$. While the central limit theorem predicts a standard Gaussian…

统计力学 · 物理学 2020-05-01 Giacomo Gradenigo , Satya N. Majumdar

Consider N particles moving independently, each one according to a subcritical continuous-time Galton-Watson process unless it hits 0, at which time it jumps instantaneously to the position of one of the other particles chosen uniformly at…

概率论 · 数学 2012-06-28 Amine Asselah , Pablo A. Ferrari , Pablo Groisman , Matthieu Jonckheere

Conditions on the generator of a Markov process to control the fluctuations of its bridges are found. In particular, continuous time random walks on graphs and gradient diffusions are considered. Under these conditions, a concentration of…

概率论 · 数学 2016-03-08 Giovanni Conforti

We consider a Galton-Watson process $\mathbf{Z}% (n)=(Z_{1}(n),Z_{2}(n))$ with two types of particles. Particles of type 2 may produce offspring of both types while particles of type 1 may produce particles of their own type only. Let…

概率论 · 数学 2015-08-28 Charline Smadi , Vladimir A. Vatutin

We consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…

概率论 · 数学 2024-07-24 Eleanor Archer , Quirin Vogel

Ben Arous, Fribergh and Sidoravicius \cite{GAV2014} proved that speed of biased random walk $RW_\lambda$ on a Galton-Watson tree without leaves is strictly decreasing for $\lambda\leq \frac{m_1}{1160},$ where $m_1$ is minimal degree of the…

概率论 · 数学 2016-10-27 Song He , Wang Longmin , Xiang Kainan