Michael Drmota ; Bernhard Gittenberger ; Alois Panholzer - The Degree Distribution of Thickened Trees

dmtcs:3561 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science - https://doi.org/10.46298/dmtcs.3561
The Degree Distribution of Thickened TreesArticle

Authors: Michael Drmota 1; Bernhard Gittenberger 1; Alois Panholzer 1

  • 1 Institut für Diskrete Mathematik und Geometrie [Wien]

We develop a combinatorial structure to serve as model of random real world networks. Starting with plane oriented recursive trees we substitute the nodes by more complex graphs. In such a way we obtain graphs having a global tree-like structure while locally looking clustered. This fits with observations obtained from real-world networks. In particular we show that the resulting graphs are scale-free, that is, the degree distribution has an asymptotic power law.


Volume: DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
Section: Proceedings
Published on: January 1, 2008
Imported on: May 10, 2017
Keywords: scale free networks,recursive trees,generating functions,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

7 Documents citing this article

Consultation statistics

This page has been seen 233 times.
This article's PDF has been downloaded 175 times.