Almost sure convergence of vertex degree densities in the vertex splitting model

DOI10.1080/15326349.2016.1182029zbMATH Open1343.05050arXiv1511.02332OpenAlexW3099536877MaRDI QIDQ2816624FDOQ2816624

Authors: Erik Thörnblad, Sigurdur Örn Stefánsson 

Publication date: 25 August 2016

Published in: Stochastic Models (Search for Journal in Brave)

Abstract: We study the limiting degree distribution of the vertex splitting model introduced in cite{DDJS:2009}. This is a model of randomly growing ordered trees, where in each time step the tree is separated into two components by splitting a vertex into two, and then inserting an edge between the two new vertices. Under some assumptions on the parameters, related to the growth of the maximal degree of the tree, we prove that the vertex degree densities converge almost surely to constants which satisfy a system of equations. Using this we are also able to strengthen and prove some previously non-rigorous results mentioned in the literature.

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

Recommendations

• Convergence of maximum bisection ratio of sparse random graphs
• Concentration of vertex degrees in a scale‐free random graph process
• Convergence in homogeneous random graphs
• Poisson convergence of numbers of vertices of a given degree in random graphs
• scientific article; zbMATH DE number 1136104
• Convergence properties of the degree distribution of some growing network models
• Convergence law for random graphs with specified degree sequence
• Convergence rates for the degree distribution in a dynamic network model
• Spectral density of random graphs: convergence properties and application in model fitting

zbMATH Keywords

almost sure convergencerandom treesvertex splittingdegree densities

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Cites Work

• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• Robust Analysis of Preferential Attachment Models with Fitness
• A random model of publication activity

This page was built for publication: Almost sure convergence of vertex degree densities in the vertex splitting model

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