English
Related papers

Related papers: The sum of powers of subtree sizes for conditioned…

200 papers

For a complex number $\alpha$, we consider the sum of the $\alpha$th powers of subtree sizes in Galton--Watson trees conditioned to be of size $n$. Limiting distributions of this functional $X_n(\alpha)$ have been determined for $\Re\alpha…

Probability · Mathematics 2023-01-24 James Allen Fill , Svante Janson , Stephan Wagner

Let $\mathcal{T}$ denote a Galton--Watson tree with offspring distribution $\xi$ satisfying $\mathbb{E}(\xi) = 1$, and let $\mathcal{T}_n$ be the Galton--Watson tree conditioned to have exactly $n$ nodes. We show that, under a mild moment…

Probability · Mathematics 2026-03-10 Fameno Rakotoniaina , Dimbinaina Ralaivaosaona

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 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 recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…

Probability · Mathematics 2020-03-24 Nicolas Broutin , Luc Devroye , Nicolas Fraiman

We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. The focus is on the case in which both $k$ and $n$ grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$.…

Probability · Mathematics 2023-10-19 Vladislav Kargin

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…

Probability · Mathematics 2020-04-21 Xing Shi Cai , Cecilia Holmgren , Svante Janson , Tony Johansson , Fiona Skerman

Let $T$ be a tree with induced partial order $\preceq$. We investigate centered Gaussian processes $X=(X_t)_{t\in T}$ represented as $$ X_t=\sigma(t)\sum_{v \preceq t}\alpha(v)\xi_v $$ for given weight functions $\alpha$ and $\sigma$ on $T$…

Probability · Mathematics 2012-12-04 Mikhail Lifshits , Werner Linde

Additive tree functionals represent the cost of many divide-and-conquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) n^\alpha when \alpha > 0 and (b) log n (the…

Probability · Mathematics 2007-05-23 James Allen Fill , Nevin Kapur

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…

Probability · Mathematics 2018-02-19 Igor Kortchemski

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…

Probability · Mathematics 2017-12-14 Romain Abraham , Jean-François Delmas

We consider a random walk on a Galton-Watson tree in random environment, in the subdiffusive case. We prove the convergence of the renormalised height function of the walk towards the continuous-time height process of a spectrally positive…

Probability · Mathematics 2019-04-19 Loïc de Raphélis

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 consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton-Watson…

Probability · Mathematics 2018-06-21 James B. Martin , Roman Stasiński

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…

Probability · Mathematics 2024-03-27 Dongjian Qian , Yang Xiao

We establish a general sufficient condition for a sequence of Galton Watson branching processes in varying environment to converge weakly. This condition extends previous results by allowing offspring distributions to have infinite…

Probability · Mathematics 2014-09-22 Vincent Bansaye , Florian Simatos

In [1] a detailed analysis was given of the large-time asymptotics of the total mass of the solution to the parabolic Anderson model on a supercritical Galton-Watson random tree with an i.i.d. random potential whose marginal distribution is…

Probability · Mathematics 2022-09-07 Frank den Hollander , Daoyi Wang

We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…

Probability · Mathematics 2012-10-24 David A. Croydon , Takashi Kumagai

We consider the simple random walk on Galton-Watson trees with supercritical offspring distribution, conditioned on non-extinction. In case the offspring distribution has finite support, we prove an upper bound for the annealed return…

Probability · Mathematics 2025-01-22 Peter Müller , Jakob Stern

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
‹ Prev 1 2 3 10 Next ›