Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model

zbMath1355.05227arXiv1003.0320MaRDI QIDQ2959931

Georg Seitz, Alois Panholzer

Publication date: 10 February 2017

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

zbMATH Keywords

limiting distributionsdegree distributionnetwork modelincreasing \(k\)-treeslocal clustering coefficientroot-to-node distances

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (3)

Shape Measures of Random Increasing k-trees ⋮ The degree profile in some classes of random graphs that generalize recursive trees ⋮ Some Properties of Random Apollonian Networks

This page was built for publication: Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model