Markov branching in the vertex splitting model

DOI10.1088/1742-5468/2012/04/P04018zbMATH Open1456.82190arXiv1103.3445MaRDI QIDQ3301358FDOQ3301358

Authors: Sigurdur Örn Stefánsson 

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Abstract: We study a special case of the vertex splitting model which is a recent model of randomly growing trees. For any finite maximum vertex degree $D$, we find a one parameter model, with parameter $alphain[0,1]$ which has a so--called Markov branching property. When $D=infty$ we find a two parameter model with an additional parameter $gammain[0,1]$ which also has this feature. In the case $D=3$, the model bears resemblance to Ford's $alpha$--model of phylogenetic trees and when $D=infty$ it is similar to its generalization, the $alphagamma$--model. For $alpha=0$, the model reduces to the well known model of preferential attachment. In the case $alpha>0$, we prove convergence of the finite volume probability measures, generated by the growth rules, to a measure on infinite trees which is concentrated on the set of trees with a single spine. We show that the annealed Hausdorff dimension with respect to the infinite volume measure is $1/alpha$. When $gamma=0$ the model reduces to a model of growing caterpillar graphs in which case we prove that the Hausdorff dimension is almost surely $1/alpha$ and that the spectral dimension is almost surely $2/(1+alpha)$. We comment briefly on the distribution of vertex degrees and correlations between degrees of neighbouring vertices.

Full work available at URL: https://arxiv.org/abs/1103.3445

Recommendations

• Random tree growth by vertex splitting
• A new family of Markov branching trees: the alpha-gamma model
• Almost sure convergence of vertex degree densities in the vertex splitting model
• Appearance of vertices of infinite order in a model of random trees
• Local limits of Markov branching trees and their volume growth

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Statistical mechanics of complex networks
• Title not available (Why is that?)
• Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
• Title not available (Why is that?)
• Quantum Geometry
• The spectral dimension of generic trees
• On the spectral dimension of causal triangulations
• Asymptotic degree distribution in random recursive trees
• The topological structure of scaling limits of large planar maps
• Distribution of nodes of a tree by degree
• Uniform Infinite Planar Triangulation and Related Time-Reversed Critical Branching Process
• The continuum random tree. I
• A new family of Markov branching trees: the alpha-gamma model
• Random walks on combs
• Characterization of sub‐Gaussian heat kernel estimates on strongly recurrent graphs
• A Limit Theoerm for Random Variables with Infinite Moments
• Condensation in nongeneric trees
• Appearance of vertices of infinite order in a model of random trees
• The spectral dimension of random brushes
• Random tree growth by vertex splitting

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Markov branching in the vertex splitting model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301358)