We extend the results of B. Bollobas, O. Riordan, J. Spencer, G. Tusnady, and Mori. We consider a model of random tree growth, where at each time unit a new node is added and attached to an already existing node chosen at random. The probability with which a node with degree $k$ is chosen is proportional to $w(k)$, where $w$ is a fixed weight function. We prove that if $w$ fulfills some asymptotic requirements then the degree sequence converges in probability, we give the limit. In particular if $w$ is asymptotically linear then the degree sequence decays with power law. Our method of proof is analytic rather than combinatorial, having the advantage of robustness: only asymptotic properties of the weight function $w$ are used, while in the cited papers the explicit law $w(k)=ak+b$ is assumed.
This paper studies the behavior of RWRE on trees in the critical case left open in previous work. For trees of exponential growth, a random perturbation of the transition probabilities can change a transient random walk into a recurrent one. This is the opposite of what occurs on trees of sub-exponential growth.
We introduce a family of branch merging operations on continuum trees and show that Ford CRTs are distributionally invariant. This operation is new even in the special case of the Brownian CRT, which we explore in more detail. The operations are based on spinal decompositions and a regenerativity preserving merging procedure of $(α, θ)$-strings of beads, that is, random intervals $[0, L_{α, θ}]$ equipped with a random discrete measure $dL^{-1}$ arising in the limit of ordered $(α, θ)$-Chinese restaurant processes as introduced recently by Pitman and Winkel. Indeed, we iterate the branch mergin…
We introduce regenerative tree growth processes as consistent families of random trees with n labelled leaves, n>=1, with a regenerative property at branch points. This framework includes growth processes for exchangeably labelled Markov branching trees, as well as non-exchangeable models such as the alpha-theta model, the alpha-gamma model and all restricted exchangeable models previously studied. Our main structural result is a representation of the growth rule by a sigma-finite dislocation measure kappa on the set of partitions of the natural numbers extending Bertoin's notion of exchangeab…
We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the continuum tree which we identified in a previous article as a distributional scaling limit of Ford's trees. In general, the Markov branching trees induced by the two-parameter growth rule are not sampling consistent, so the existence of compact limiting trees cannot be deduced from previous work on the sampling consistent case. We develop here a new approach to es…
We consider the model of Brownian motion indexed by the Brownian tree. For every $r\geq 0$ and every connected component of the set of points where Brownian motion is greater than $r$, we define the boundary size of this component, and we then show that the collection of these boundary sizes evolves when $r$ varies like a well-identified growth-fragmentation process. We then prove that the same growth-fragmentation process appears when slicing a Brownian disk at height $r$ and considering the perimeters of the resulting connected components.
We prove that the growth constants for nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd are asymptotic to 2de as the dimension goes to infinity, and that their critical one-point functions converge to e. Similar results are obtained in dimensions d>8 in the limit of increasingly spread-out models; in this case the result for the growth constant is a special case of previous results of M. Penrose. The proof is elementary, once we apply previous results of T. Hara and G. Slade obtained using the lace expansion.
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate proportional to their sizes (isolation of connected component). A phase transition occurs when the isolation is able to stop the growth fragmentation process and cause extinction. When the process survives, the number of clusters increases exponentially and we prove that the normalized empirical measure of clusters a.s. converges to a limit law on recursive …
We construct random locally compact real trees called Levy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton-Watson trees with i.i.d. exponential branch lengths that is consistent under Bernoulli percolation on leaves; we define the Levy tree as the limit of this growing family with respect to the Gromov-Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees and does not make use of the height process introduced by Le Gall and Le Jan to code the ge…
We introduce the notion of a hereditary property for rooted real trees and we also consider reduction of trees by a given hereditary property. Leaf-length erasure, also called trimming, is included as a special case of hereditary reduction. We only consider the metric structure of trees, and our framework is the space $\bT$ of pointed isometry classes of locally compact rooted real trees equipped with the Gromov-Hausdorff distance. Some of the main results of the paper are a general tightness criterion in $\bT$ and limit theorems for growing families of trees. We apply these results to Galton-…
In invasion percolation, the edges of successively maximal weight (the outlets) divide the invasion cluster into a chain of ponds separated by outlets. On the regular tree, the ponds are shown to grow exponentially, with law of large numbers, central limit theorem and large deviation results. The tail asymptotics for a fixed pond are also studied and are shown to be related to the asymptotics of a critical percolation cluster, with a logarithmic correction.
We compute the first three terms of the 1/d expansions for the growth constants and one-point functions of nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd, with rigorous error estimates. The proof uses the lace expansion, together with a new expansion for the one-point functions based on inclusion-exclusion.
In this article, we prove global and local (point-wise) volume and heat kernel bounds for the continuum random tree. We demonstrate that there are almost-surely logarithmic global fluctuations and log-logarithmic local fluctuations in the volume of balls of radius $r$ about the leading order polynomial term as $r\to0$. We also show that the on-diagonal part of the heat kernel exhibits corresponding global and local fluctuations as $t\to0$ almost-surely. Finally, we prove that this quenched (almost-sure) behaviour contrasts with the local annealed (averaged over all realisations of the tree) vo…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen at random with probability proportional to its weight. In the case where the total weight of the tree at step $n$ grows polynomially in $n$, we obtained in (Pain-Sénizergues 2022) an asymptotic expansion for the height of the tree, which falls into the university class of the maximum of branching random walks. In this paper, we consider the case of a total weight growing sub-polynomially in $n$ and obtain asymptotics for the height of the tree …
The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous's Brownian continuum random tree, the random tree-like object naturally associated with a standard Brownian excursion, may be thought of as a random compact real tree. The continuum random tree is a scaling limit as N tends to infinity of both a critical Galton-Watson tree conditioned to have total population size N as well as a uniform random rooted combinatorial tree with N vertices. The Aldo…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of weights, the first order for the height of such trees has been recently established in [Electron. J. Probab. 26 (2021), Paper No. 80] by one of the authors. In this paper, we obtain the second and third orders in the asymptotic expansion of the height of weighted recursive trees, under similar assumptions. Our methods are inspired from those used to prove similar r…
We study the supercritical contact process on Galton-Watson trees and periodic trees. We prove that if the contact process survives weakly then it dominates a supercritical Crump-Mode-Jagers branching process. Hence the number of infected sites grows exponentially fast. As a consequence we conclude that the contact process dies out at the critical value $λ_1$ for weak survival, and the survival probability $p(λ)$ is continuous with respect to the infection rate $λ$. Applying this fact, we show the contact process on a general periodic tree experiences two phase transitions in the sense that $λ…
We consider a class of density-dependent branching processes which generalises exponential, logistic and Gompertz growth. A population begins with a single individual, grows exponentially initially, and then growth may slow down as the population size moves towards a carrying capacity. At a time while the population is still growing superlinearly, a fixed number of individuals are sampled and their coalescent tree is drawn. Taking the sampling time and carrying capacity simultaneously to infinity, we prove convergence of the coalescent tree to a limiting tree which is in a sense universal over…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum degrees in weighted recursive trees when the vertex-weights are almost surely bounded and their distribution function satisfies a mild regularity condition near zero. We are able to specify higher-order corrections to the first order growth of the maximum degree established in prior work. The accuracy of the results depends on the behaviour of the weight dist…
We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root, these sub-trees are independent and their distributions only depend upon their respective sizes. The laws of the elements of a Markov branching family are characterised by a sequence of probability distributions on the sets of integer partitions which describes how the sizes of the sub-trees above the root are distributed. We prove that under some natural a…
We study certain consistent families $(F_λ)_{λ\ge 0}$ of Galton-Watson forests with lifetimes as edge lengths and/or immigrants as progenitors of the trees in $F_λ$. Specifically, consistency here refers to the property that for each $μ\leλ$, the forest $F_μ$ has the same distribution as the subforest of $F_λ$ spanned by the black leaves in a Bernoulli leaf colouring, where each leaf of $F_λ$ is coloured in black independently with probability $μ/λ$. The case of exponentially distributed lifetimes and no immigration was studied by Duquesne and Winkel and related to the genealogy of Markovian c…
This paper considers random graph approach to simulate irreversible step-growth polymerization. We study generalization of approach developed by Kryven~I. by introducing different types of bonds each with its own weight representing corresponding reaction rate.
Consider a rooted infinite Galton-Watson tree with mean offspring number $m>1$, and a collection of i.i.d. positive random variables $ξ_e$ indexed by all the edges in the tree. We assign the resistance $m^d ξ_e$ to each edge $e$ at distance $d$ from the root. In this random electric network, we study the asymptotic behavior of the effective resistance and conductance between the root and the vertices at depth $n$. Our results generalize an existing work of Addario-Berry, Broutin and Lugosi on the binary tree to random branching networks.
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the merging of directed ordered paths from leaves to the root. Combining the likelihood with an assigned prior distribution leads to a posterior leaf distribution from which we sample attachment points for new vertices. We present computational examples of such Bayesian tree growth. Although the discussion is generic, the initial motivation for the paper is the …
We introduce a non-increasing tree growth process $((T_n,σ_n),\, n\ge 1)$, where $T_n$ is a rooted labeled tree on $n$ vertices and $σ_n$ is a permutation of the vertex labels. The construction of $(T_{n},σ_n)$ from $(T_{n-1},σ_{n-1})$ involves rewiring a random (possibly empty) subset of edges in $T_{n-1}$ towards the newly added vertex; as a consequence $T_{n-1} \not\subset T_n$ with positive probability. The key feature of the process is that the shape of $T_n$ has the same law as that of a random recursive tree, while the degree distribution of any given vertex is not monotonous in the pro…
It is known that for every $α\geq 1$ there is a planar triangulation in which every ball of radius $r$ has size $Θ(r^α)$. We prove that for $α<2$ every such triangulation is quasi-isometric to a tree. The result extends to Riemannian 2-manifolds of finite genus, and to large-scale-simply-connected graphs. We also prove that every planar triangulation of asymptotic dimension 1 is quasi-isometric to a tree.
Exploiting a bijective correspondence between planar quadrangulations and well-labeled trees, we define an ensemble of infinite surfaces as a limit of uniformly distributed ensembles of quadrangulations of fixed finite volume. The limit random surface can be described in terms of a birth and death process and a sequence of multitype Galton--Watson trees. As a consequence, we find that the expected volume of the ball of radius $r$ around a marked point in the limit random surface is $Θ(r^4)$.
The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is not known explicitly, but we show that it is strictly increasing and infinitely differentiable. Moreover, we give an explicit lower bound on $f'(c)$. A key lemma is the following. Let $\PGW(λ)$ denote a Galton-Watson tree having Poisson offspring distribution with parameter $λ$. Suppose that $λ^*>λ>1$. We show that $\PGW(λ^*)$ conditioned to survive forever …
We model the growth of a cell population by a piecewise deterministic Markov branching tree. Each cell splits into two offsprings at a division rate $B(x)$ that depends on its size $x$. The size of each cell grows exponentially in time, at a rate that varies for each individual. We show that the mean empirical measure of the model satisfies a growth-fragmentation type equation if structured in both size and growth rate as state variables. We construct a nonparametric estimator of the division rate $B(x)$ based on the observation of the population over different sampling schemes of size $n$ on …
We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model generalises the preferential attachment model and Ford's $α$-model for phylogenetic trees. We develop a mean field theory for the vertex degree distribution, prove that the mean field theory is exact in some special cases and check that it agrees with numerical simulations in general. We calculate various correlation functions and show that the intrinsic Hausdorff d…
Assign i.i.d. standard exponential edge weights to the edges of the complete graph K_n, and let M_n be the resulting minimum spanning tree. We show that M_n converges in the local weak sense (also called Aldous-Steele or Benjamini-Schramm convergence), to a random infinite tree M. The tree M may be viewed as the component containing the root in the wired minimum spanning forest of the Poisson-weighted infinite tree (PWIT). We describe a Markov process construction of M starting from the invasion percolation cluster on the PWIT. We then show that M has cubic volume growth, up to lower order flu…
As known, the commonly-utilized ways to determine mean first-passage time $\overline{\mathcal{F}}$ for random walk on networks are mainly based on Laplacian spectra. However, methods of this type can become prohibitively complicated and even fail to work when the Laplacian matrix of network under consideration is difficult to describe in the first place. In this paper, we propose an effective approach to determining quantity $\overline{\mathcal{F}}$ on some widely-studied tree networks. To this end, we first build up a general formula between Wiener index $\mathcal{W}$ and $\overline{\mathcal{…
We first consider the growth of trees by probabilistic attachment of new vertices to leaves. This leads to a growth model based on vertex clusters and probabilities assigned to clusters. This model turns out to be readily applicable to attachment at any depth of the tree, hence the paper evolves to a general study of tree growth by cluster-based attachment. Drawing inspiration from the concept of intrinsic vertex fitness due to Bianconi and Barabási, we introduce vertex mass as an additive intrinsic vertex attribute. Unlike Bianconi and Barabási who used fitness as a vertex degree multiplier i…
Given an edge-weighted tree $T$ with $n$ leaves, sample the leaves uniformly at random without replacement and let $W_k$, $2 \le k \le n$, be the length of the subtree spanned by the first $k$ leaves. We consider the question, "Can $T$ be identified (up to isomorphism) by the joint probability distribution of the random vector $(W_2, \ldots, W_n)$?" We show that if $T$ is known {\em a priori} to belong to one of various families of edge-weighted trees, then the answer is, "Yes." These families include the edge-weighted trees with edge-weights in general position, the ultrametric edge-weighted …
Following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133-141], the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyze weighted depths of nodes with given labels, the last inserted node, nodes ordered as visited by the depth first search process, the weighted path length and the weighted Wiener index in a random binary search tree. We establish three regimes of nodes depending on whether the second order behaviour of their weighted depths follows from fluctuations of t…
A finite \emph{one-sided tree} of height $h$ is defined as a rooted planar tree obtained by grafting branches on one side, say the right, of a spine, i.e. a linear path of length $h$ starting at the root, such that the resulting tree has no simple path starting at the root of length greater than $h$. We consider the distribution $τ_N$ on the set of one-sided trees $T$ of fixed size $N$, such that the weight of $T$ is proportional to $e^{-μh(T)}$, where $μ$ is a real constant and $h(T)$ denotes the height of $T$. We show that, for $N$ large, $τ_N$ has a weak limit as a probability measure suppo…
We consider the problem of inferring an ancestral state from observations at the leaves of a tree, assuming the state evolves along the tree according to a two-state symmetric Markov process. We establish a general branching rate condition under which maximum parsimony, a common reconstruction method requiring only the knowledge of the tree, succeeds better than random guessing uniformly in the depth of the tree. We thereby generalize previous results of (Zhang et al., 2010) and (Gascuel and Steel, 2010). Our results apply to both deterministic and i.i.d. edge weights.
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 when $w_n$ grows faster than exponentially with $n$. In this case the measures on trees of finite size $N$ converge weakly as $N$ tends to infinity to a measure which is concentrated on a single tree with one vertex of infinite degree. For explicit weight factors of the form $w_n=((n-1)!)^α$ with $α>0$ we obtain more refined results about the approach to the …
In this paper, we introduce a new concept: the transfinite fractal dimension of graph sequences motivated by the notion of fractality of complex networks proposed by Song et al. We show that the definition of fractality cannot be applied to networks with `tree-like' structure and exponential growth rate of neighborhoods. However, we show that the definition of fractal dimension could be modified in a way that takes into account the exponential growth, and with the modified definition, the fractal dimension becomes a proper parameter of graph sequences. We find that this parameter is related to…
