English
Related papers

Related papers: Non-fringe subtrees in conditioned Galton--Watson …

200 papers

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

Probability · Mathematics 2026-03-06 Arthur Blanc-Renaudie , Emmanuel Kammerer

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.…

Probability · Mathematics 2015-06-12 Behzad Mehrdad , Sanchayan Sen , Lingjiong Zhu

We prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma,…

Combinatorics · Mathematics 2026-05-29 Béla Csaba

We prove an invariance principle for linearly edge reinforced random walks on $\gamma$-stable critical Galton-Watson trees, where $\gamma \in (1,2]$ and where the edge joining $x$ to its parent has rescaled initial weight $d(\rho,…

Probability · Mathematics 2025-09-30 George Andriopoulos , Eleanor Archer

We prove a scaling limit theorem for discrete Galton-Watson processes in varying environments. A simple sufficient condition for the weak convergence in the Skorokhod space is given in terms of probability generating functions. The limit…

Probability · Mathematics 2022-04-14 Fang Rongjuan , Li Zenghu , Liu Jiawei

We describe the asymptotic behavior of the conditional least squares estimator of the offspring mean for subcritical strongly stationary Galton--Watson processes with regularly varying immigration with tail index $\alpha \in (1,2)$. The…

Statistics Theory · Mathematics 2020-12-24 Matyas Barczy , Bojan Basrak , Péter Kevei , Gyula Pap , Hrvoje Planinić

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…

Probability · Mathematics 2025-12-09 Denis Villemonais , Nicolas Zalduendo

We describe the distribution of the number and location of the fixed points of permu- tations that avoid the pattern 321 via a bijection with rooted plane trees on n + 1 vertices. Using the local limit theorem for Galton-Watson trees, we…

Combinatorics · Mathematics 2019-04-02 Christopher Hoffman , Douglas Rizzolo , Erik Slivken

We investigate the range $\mathcal{R}_T$ of the diffusive biased walk $\mathbb{X}$ on a Galton-Watson tree $\mathbb{T}$ in random environment, that is to say the sub-tree of $\mathbb{T}$ of all distinct vertices visited by this walk up to…

Probability · Mathematics 2025-12-23 Alexis Kagan

We study the critical parameter u^{*} of random interlacements percolation (introduced by A.S Sznitman in arXiv:0704.2560) on a Galton-Watson tree conditioned on the non-extinction event. Starting from the previous work of A. Teixeira in…

Probability · Mathematics 2010-12-06 Martin Tassy

We consider a transient random walk $(X_n)$ in random environment on a Galton--Watson tree. Under fairly general assumptions, we give a sharp and explicit criterion for the asymptotic speed to be positive. As a consequence, situations with…

Probability · Mathematics 2011-01-11 Elie Aidekon

Let $N=\binom{n}{2}$ and $s\geq 2$. Let $e_{i,j},\,i=1,2,\ldots,N,\,j=1,2,\ldots,s$ be $s$ independent permutations of the edges $E(K_n)$ of the complete graph $K_n$. A {\em MultiTree} is a set $I\subseteq [N]$ such that the edge sets…

Combinatorics · Mathematics 2021-10-19 Alan Frieze , Wesley Pegden

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

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

We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on itsout-degree. Using a penalization method, we exhibit new martingales where the number of marks up to level n -- 1…

Probability · Mathematics 2024-03-04 Romain Abraham , Sonia Boulal , Pierre Debs

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…

Probability · Mathematics 2020-10-19 Gabriel Berzunza , Xing Shi Cai , Cecilia Holmgren

In this paper, we study the Galton-Watson process in the random environment for the particular case when the number of the offsprings in each generation has the fractional linear generation function with random parameters. In this case, the…

Probability · Mathematics 2020-12-01 Dan Han , Stanislav Molchanov , Yanjmaa Jutmaan

Pruning processes $(\mathcal{F}(\theta),\theta\geq 0)$ have been studied separately for Galton-Watson trees and for L\'evy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem…

Probability · Mathematics 2014-09-04 Hui He , Matthias Winkel

We study an iterated temporal and contemporaneous aggregation of $N$ independent copies of a strongly stationary subcritical Galton-Watson branching process with regularly varying immigration having index $\alpha \in (0, 2)$. Limits of…

Probability · Mathematics 2020-12-09 Matyas Barczy , Fanni K. Nedényi , Gyula Pap

A class of branching processes in varying environments is exhibited which become extinct almost surely even though the means M_n grow fast enough so that sum M_n^{-1} is finite. In fact, such a process is constructed for every offspring…

Probability · Mathematics 2007-05-23 Robin Pemantle