Related papers: The size of random fragmentation trees
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…
We investigate a neutral model for speciation and extinction, the constant rate birth-death process. The process is conditioned to have $n$ extant species today, we look at the tree distribution of the reconstructed trees-- i.e. the trees…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…
We study the kinetics of random sequential adsorption of a mixture of particles with continuous distribution of sizes for different deposition rules. It appears in the long time limit the resulting system can be described using the fractal…
In this paper, we study Ruelle's probability cascades in the framework of time-inhomogeneous fragmentation processes. We describe Ruelle's cascades mechanism exhibiting a family of measures $(\nu_t,t\in [0,1[)$ that characterizes its…
For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure. The proof is based on the martingale central limit theorem…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
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…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
We study the asymptotic behavior af the number of cuts $X(T_n)$ needed to isolate the root in a rooted binary random tree $T_n$ with $n$ leaves. We focus on the case of subtrees of the Continuum Random Tree generated by uniform sampling of…
Growth-fragmentation processes describe the evolution of systems of cells which grow continuously and fragment suddenly; they are used in models of cell division and protein polymerisation. Typically, we may expect that in the long run, the…
We consider a model of stationary population with random size given by a continuous state branching process with immigration with a quadratic branching mechanism. We give an exact elementary simulation procedure of the genealogical tree of…
We introduce a model of tree-rooted planar maps weighted by their number of $2$-connected blocks. We study its enumerative properties and prove that it undergoes a phase transition. We give the distribution of the size of the largest…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
The conformations of topologically constrained double-folded ring polymers can be described as wrappings of randomly branched primitive trees. We extend previous work on the tree statistics under different (solvent) conditions to explore…
Consider a Markov chain on the space of rooted real binary trees that randomly removes leaves and reinserts them on a random edge and suitably rescales the lengths of edges. This chain was introduced by David Aldous who conjectured a…
Phylogenetic trees represent the evolutionary relationships between extant lineages, where extinct or non-sampled lineages are omitted. Extending the work of Stadler and collaborators, this paper focuses on the branch lengths in…
For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…
Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\le 0$ is the root of a tree. Vertices labeled by positive integers $n \ge 1$…
Random forests are decision tree ensembles that can be used to solve a variety of machine learning problems. However, as the number of trees and their individual size can be large, their decision making process is often incomprehensible. In…