Abstract : 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.
https://hal.inria.fr/hal-01194676 Contributor : Coordination Episciences IamConnect in order to contact the contributor Submitted on : Monday, September 7, 2015 - 12:50:59 PM Last modification on : Wednesday, October 13, 2021 - 7:58:04 PM Long-term archiving on: : Tuesday, December 8, 2015 - 12:56:53 PM
Michael Drmota, Bernhard Gittenberger, Alois Panholzer. The Degree Distribution of Thickened Trees. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.149-162, ⟨10.46298/dmtcs.3561⟩. ⟨hal-01194676⟩