English
Related papers

Related papers: Cutting down trees with a Markov chainsaw

200 papers

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…

Probability · Mathematics 2026-03-26 Alexis Kagan

A population genetics model based on a multitype branching process, or equivalently a Galton-Watson branching process for multiple alleles, is pre- sented. The diffusion limit forward Kolmogorov equation is derived for the case of neutral…

Populations and Evolution · Quantitative Biology 2018-02-21 Conrad J. Burden , Yi Wei

In our previous work, we introduced the random $k$-cut number for rooted graphs. In this paper, we show that the distribution of the $k$-cut number in complete binary trees of size $n$, after rescaling, is asymptotically a periodic function…

Probability · Mathematics 2020-04-21 Xing Shi Cai , Cecilia Holmgren

We introduce generalized dynamical pruning on rooted binary trees with edge lengths. The pruning removes parts of a tree $T$, starting from the leaves, according to a pruning function defined on subtrees within $T$. The generalized pruning…

Probability · Mathematics 2018-08-14 Yevgeniy Kovchegov , Ilya Zaliapin

We give an example of a transient reversible Markov chain that almost surely has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer…

Probability · Mathematics 2008-05-19 Nicholas James , Russell Lyons , Yuval Peres

In this paper we study the genealogical structure of a Galton-Watson process with neutral mutations, where the initial population is large and mutation rate is small \cite{B2}. Namely, we extend in two directions the results obtained in…

Probability · Mathematics 2015-08-11 Airam Blancas Benítez , Víctor Rivero

We consider the asymptotics of various estimators based on a large sample of branching trees from a critical multi-type Galton-Watson process, as the sample size increases to infinity. The asymptotics of additive functions of trees, such as…

Probability · Mathematics 2007-05-23 Zhiyi Chi

We consider fragmentations of an R-tree $T$ driven by cuts arriving according to a Poisson process on $T \times [0, \infty)$, where the first co-ordinate specifies the location of the cut and the second the time at which it occurs. The…

Probability · Mathematics 2016-06-17 Louigi Addario-Berry , Daphné Dieuleveut , Christina Goldschmidt

Recently, Abraham and Delmas constructed the distributions of super-critical L\'evy trees truncated at a fixed height by connecting super-critical L\'evy trees to (sub)critical L\'evy trees via a martingale transformation. A similar…

Probability · Mathematics 2013-05-08 Hui He , Nana Luan

We consider a model of random loops on Galton-Watson trees with an offspring distribution with high expectation. We give the configurations a weighting of $\theta^{\#\text{loops}}$. For many $\theta>1$ these models are equivalent to certain…

Mathematical Physics · Physics 2018-12-05 Volker Betz , Johannes Ehlert , Benjamin Lees

We prove that the speed of a biased random walk on a supercritical Galton-Watson tree conditioned to survive is analytic within the ballistic regime. This extends the previous work arXiv:1906.07913 in which it was shown that the speed is…

Probability · Mathematics 2020-10-06 Adam Bowditch , Yuki Tokushige

1 Sharp prediction of extinction times is needed in biodiversity monitoring and conservation management. 2 The Galton-Watson process is a classical stochastic model for describing population dynamics. Its evolution is like the matrix…

Applications · Statistics 2019-01-29 B Cloez , T Daufresne , M Kerioui , B Fontez

We use local limits of Galton-Watson trees to establish local limit theorems for permutations conditioned to avoid a pattern of length three. In the case of 321-avoiding permutations our results resolve an open problem of Pinsky. In the…

Probability · Mathematics 2024-01-05 Jungeun Park , Douglas Rizzolo

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

Probability · Mathematics 2016-04-08 Charles Bordenave , Pietro Caputo

We give a description of invariants and attractors of the critical and subcritical Galton-Watson tree measures under the operation of Horton pruning (cutting tree leaves with subsequent series reduction). Under a regularity condition, the…

Probability · Mathematics 2020-10-27 Yevgeniy Kovchegov , Ilya Zaliapin

On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…

Probability · Mathematics 2023-08-21 Héloïse Constantin

A curious connection exists between the theory of optimal stopping for independent random variables, and branching processes. In particular, for the branching process $Z_n$ with offspring distribution $Y$, there exists a random variable $X$…

Probability · Mathematics 2007-05-23 David Assaf , Larry Goldstein , Ester Samuel-Cahn

The limit distribution of the total cost incurred by splitting a tree uniformly distributed on the set of all finite free trees, appears as an additive functional induced by a toll equal to the square of the size of tree. The main tools…

Probability · Mathematics 2012-04-22 Elahe Zohoorian Azad

We consider a branching random walk initiated by a single particle at location 0 in which particles alternately reproduce according to the law of a Galton-Watson process and disperse according to the law of a driftless random walk on the…

Probability · Mathematics 2014-03-31 Steven P. Lalley , Yuan Shao

We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation…

Probability · Mathematics 2018-02-06 Marcus Michelen , Robin Pemantle , Josh Rosenberg