中文
相关论文

相关论文: Invariance principles for spatial multitype Galton…

200 篇论文

We consider a random walk on a Galton-Watson tree whose offspring distribution has a regular varying tail of order $\kappa\in (1,2)$. We prove the convergence of the renormalised height function of the walk towards the continuous-time…

概率论 · 数学 2024-03-27 Dongjian Qian , Yang Xiao

We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a…

概率论 · 数学 2016-04-27 Romain Abraham , Aymen Bouaziz , Jean-François Delmas

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

概率论 · 数学 2023-04-11 Christoffer Olsson

We introduce and study a model of plane random trees generalizing the famous Bienaym\'e--Galton--Watson model but where births and deaths are locally correlated. More precisely, given a random variable $(B,H)$ with values in $\{1,2,3,…

概率论 · 数学 2025-11-21 Ariane Carrance , Jérôme Casse , Nicolas Curien

In this paper we study the recurrence and transience of the $\mathbb{Z}^d$-valued branching random walk in random environment indexed by a critical Bienaym\'e-Galton-Watson tree, conditioned to survive. The environment is made either of…

概率论 · 数学 2025-01-03 Alexandre Legrand , Christophe Sabot , Bruno Schapira

Take a continuous-time Galton-Watson tree. If the system survives until a large time $T$, then choose $k$ particles uniformly from those alive. What does the ancestral tree drawn out by these $k$ particles look like? Some special cases are…

概率论 · 数学 2019-02-14 Simon C. Harris , Samuel G. G. Johnston , Matthew I. Roberts

We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…

The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the k-cut number of conditioned Galton-Watson trees converges…

概率论 · 数学 2020-10-19 Gabriel Berzunza , Xing Shi Cai , Cecilia Holmgren

We provide a simple forest model to encode the genealogical structure of a multitype Galton-Watson process with immigration. We provide two encodings of these forests by stochastic processes. We show, under appropriate conditions, the…

概率论 · 数学 2021-05-10 David Clancy

We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and type and give rise to (size,type)-children in a Galton-Watson fashion, with the rule that…

概率论 · 数学 2019-12-17 Bénédicte Haas , Robin Stephenson

We prove a scaling limit for globally centered discrete snakes on size-conditioned critical Bienaym\'e trees. More specifically, under a global finite variance condition, we prove convergence in the sense of random finite-dimensional…

We consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of…

概率论 · 数学 2026-03-26 Alexis Kagan

We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…

概率论 · 数学 2025-12-09 Denis Villemonais , Nicolas Zalduendo

Drmota and Gittenberger (1997) proved a conjecture due to Aldous (1991) on the height profile of a Galton-Watson tree with an offspring distribution of finite variance, conditioned on a total size of $n$ individuals. The conjecture states…

概率论 · 数学 2011-01-20 Götz Kersting

Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees…

概率论 · 数学 2020-06-11 Tobias Johnson , Moumanti Podder , Fiona Skerman

We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large…

概率论 · 数学 2015-08-11 Xin He

We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…

概率论 · 数学 2018-08-14 Yevgeniy Kovchegov , Ilya Zaliapin

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

We prove local convergence results of rerooted conditioned multi-type Galton--Watson trees. The limit objects are multitype variants of the random sin-tree constructed by Aldous (1991), and differ according to which types recur infinitely…

概率论 · 数学 2021-02-24 Benedikt Stufler

We investigate the genealogy of a sample of $k\geq1$ particles chosen uniformly without replacement from a population alive at large times in a critical discrete-time Galton-Watson process in a varying environment (GWVE). We will show that…

概率论 · 数学 2024-03-04 Simon C. Harris , Sandra Palau , Juan Carlos Pardo