相关论文: Invariance principles for pruning processes of Gal…

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

We consider a Galton--Watson tree with offspring distribution $\nu$ of finite mean. The uniform measure on the boundary of the tree is obtained by putting mass $1$ on each vertex of the $n$-th generation and taking the limit $n\to \infty$.…

In this note, we introduce a unified analytic framework that connects simple varieties of trees, Bienayme-Galton-Watson processes and Khinchin families. Using Lagrange's inversion formula, we derive new coefficient-based expressions for…

We establish a phase transition for the parking process on critical Galton--Watson trees. In this model, a random number of cars with mean $m$ and variance $\sigma^{2}$ arrive independently on the vertices of a critical Galton--Watson tree…

We consider a natural model of inhomogeneous random graphs that extends the classical Erd\H os-R\'enyi graphs and shares a close connection with the multiplicative coalescence, as pointed out by Aldous [AOP 1997]. In this model, the…

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

This paper proposes a novel numerical method for computing the density of the limit random variable associated with a supercritical Galton-Watson process. This random variable captures the effect of early demographic fluctuations and…

We study the Lyapunov exponents of models that are close to skew product systems over a C__ uniformly expanding transformation of the circle. For a continuous fibre map $\phi$, analytic, increasing, and convex in the fibre variable, we…

We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…

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…

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…

We observe the Galton-Watson Branching Processes. Limit properties of transition functions and their convergence to invariant measures are investigated.

We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…

By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable $\Theta$ which is distributed, conditionally given the tree, according to the probability law introduced by Janson as the limit…

We consider the passage time problem for L\'evy processes, emphasising heavy tailed cases. Results are obtained under quite mild assumptions, namely, drift to $-\infty$ a.s. of the process, possibly at a linear rate (the finite mean case),…

We prove a general fluctuation limit theorem for Galton-Watson branching processes with immigration. The limit is a time-inhomogeneous OU type process driven by a spectrally positive Levy process. As applications of this result, we obtain…

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

We consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…

For the critical Galton--Watson process with geometric offspring distributions we provide sharp barrier estimates for barriers which are (small) perturbations of linear barriers. These are useful in analyzing the cover time of finite graphs…