Random tree growth by vertex splitting
From MaRDI portal
Publication:3301046
Abstract: 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 dimension can vary from one to infinity, depending on the parameters of the model.
Recommendations
Cites work
- Asymptotic degree distribution in random recursive trees
- Branching processes in biology
- Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
- Dense Sets of Diagonalizable Matrices
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 850224 (Why is no real title available?)
- scientific article; zbMATH DE number 3190745 (Why is no real title available?)
- Non-negative matrices and Markov chains.
- Quantum Geometry
- Statistical mechanics of complex networks
- Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today.
- The continuum random tree. I
- The spectral dimension of generic trees
Cited in
(5)
This page was built for publication: Random tree growth by vertex splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301046)