English
Related papers

Related papers: Limit theorems for conditioned non-generic Galton-…

200 papers

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

Probability · Mathematics 2012-10-24 David A. Croydon

We study the bijection between binary Galton--Watson trees in continuous time and their exploration process, both in the sub- and in the supercritical cases. We then take the limit over renormalized quantities, as the size of the population…

Probability · Mathematics 2013-05-07 Mamadou Ba , Etienne Pardoux , Ahmadou Bamba Sow

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 look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

Mathematical Physics · Physics 2015-05-27 Svante Janson , Thordur Jonsson , Sigurdur Orn Stefansson

In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…

Probability · Mathematics 2022-08-02 Eleanor Archer

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…

Probability · Mathematics 2022-04-26 Louigi Addario-Berry , Anna Brandenberger , Jad Hamdan , Céline Kerriou

The asymptotic behavior, as $n\rightarrow \infty $ of the probability of the event that a decomposable critical branching process $\mathbf{Z}(m)=(Z_{1}(m),...,Z_{N}(m)),$ $m=0,1,2,...,$ with $N$ types of particles dies at moment $n$ is…

Probability · Mathematics 2015-04-21 Vladimir Vatutin , Elena Dyakonova

We consider branching random walks built on Galton--Watson trees with offspring distribution having a bounded support, conditioned to have $n$ nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of ``globally…

Probability · Mathematics 2008-01-28 Jean-François Marckert

This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…

Probability · Mathematics 2026-04-08 Gabriel Berzunza Ojeda , Cecilia Holmgren , Svante Janson

Condensation is the phenomenon whereby one of a sum of random variables contributes a finite fraction to the sum. It is manifested as an aggregation phenomenon in diverse physical systems such as coalescence in granular media, jamming in…

Statistical Mechanics · Physics 2014-01-20 Juraj Szavits-Nossan , Martin R. Evans , Satya N. Majumdar

A Galton-Watson process in varying environment is a discrete time branching process where the offspring distributions vary among generations. Based on a two-spine decomposition technique, we provide a probabilistic argument of a Yaglom-type…

Probability · Mathematics 2020-10-16 Natalia Cardona-Tobón , Sandra Palau

We study minimal vertex covers of trees. Contrarily to the number $N_{vc}(A)$ of minimal vertex covers of the tree $A$, $\log N_{vc}(A)$ is a self-averaging quantity. We show that, for large sizes $n$, $\lim_{n\to +\infty} <\log…

Statistical Mechanics · Physics 2009-11-10 Stephane Coulomb

We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $\eps$, agrees up to generation $K$ with a regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring distribution and…

Probability · Mathematics 2012-04-16 Nathanael Berestycki , Nina Gantert , Peter Morters , Nadia Sidorova

We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour, which started from the root of a tree, spreads out through an infinite…

Probability · Mathematics 2016-11-11 Valdivino Vargas Junior , Fábio Prates Machado , Krishnamurthi Ravishankar

Branching processes in a random environment are natural generalisations of Galton-Watson processes. In this paper we analyse the asymptotic decay of the survival probability for a sequence of slightly supercritical branching processes in an…

Probability · Mathematics 2024-12-23 Florin Boenkost , Götz Kersting

We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…

Probability · Mathematics 2016-03-07 Alexey Lindo , Serik Sagitov

We consider conditioned Galton-Watson trees and show asymptotic normality of additive functionals that are defined by toll functions that are not too large. This includes, as a special case, asymptotic normality of the number of fringe…

Probability · Mathematics 2013-12-05 Svante Janson

We establish uniform sub-exponential tail bounds for the width, height and maximal outdegree of critical Bienaym\'e-Galton-Watson trees conditioned on having a large fixed size, whose offspring distribution belongs to the domain of…

Probability · Mathematics 2018-02-19 Igor Kortchemski

Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton-Watson trees. For example, let $\mathcal{T}_1$ be the…

Probability · Mathematics 2022-08-05 Tobias Johnson
‹ Prev 1 4 5 6 7 8 10 Next ›