Fragmentation of random trees
From MaRDI portal
Abstract: We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees, namely, a forest. We study statistical properties of trees and nodes in this heterogeneous forest, and find that the fraction of remaining nodes m characterizes the system in the limit N --> infty. We obtain analytically the size density phi_s of trees of size s. The size density has power-law tail phi_s ~ s^(-alpha) with exponent alpha=1+1/m. Therefore, the tail becomes steeper as further nodes are removed, and the fragmentation process is unusual in that exponent alpha increases continuously with time. We also extend our analysis to the case where nodes are added as well as removed, and obtain the asymptotic size density for growing trees.
Recommendations
Cited in
(10)- The genealogy of self-similar fragmentations with negative index as a continuum random tree
- Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
- Fragmentation Trees Reloaded
- scientific article; zbMATH DE number 6683495 (Why is no real title available?)
- scientific article; zbMATH DE number 6683511 (Why is no real title available?)
- Breakage and restoration in recursive trees
- Stochastic resetting in a networked multiparticle system with correlated transitions
- A growth-fragmentation-isolation process on random recursive trees and contact tracing
- Size distribution of clusters in site-percolation on random recursive tree
- The size of random fragmentation trees
This page was built for publication: Fragmentation of random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175162)