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 Trees
Authors: Michael Drmota 1; Bernhard Gittenberger 1; Alois Panholzer 1
NULL##NULL##NULL
Michael Drmota;Bernhard Gittenberger;Alois Panholzer
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.
Bhutani, Kiran R.; Kalpathy, Ravi; Mahmoud, Hosam, 2022, Random Networks Grown By Fusing Edges Via Urns, Network Science, 10, 4, pp. 347-360, 10.1017/nws.2022.30.
Drmota, Michael; Gittenberger, Bernhard; Kutzelnigg, Reinhard, 2009, Combinatorial Models For Cooperation Networks, Lecture Notes In Computer Science, pp. 206-217, 10.1007/978-3-642-10217-2_22.
Mahmoud, Hosam, 2021, Profile Of Random Exponential Recursive Trees, Methodology And Computing In Applied Probability, 24, 1, pp. 259-275, 10.1007/s11009-020-09831-9.
Zhang, Panpan, 2020, On Several Properties Of A Class Of Preferential Attachment TreesâPlane-Oriented Recursive Trees, Probability In The Engineering And Informational Sciences, 35, 4, pp. 839-857, 10.1017/s0269964820000261.
Zhang, Panpan; Mahmoud, Hosam M., 2019, On Nodes Of Small Degrees And Degree Profile In Preferential Dynamic Attachment Circuits, Methodology And Computing In Applied Probability, 22, 2, pp. 625-645, 10.1007/s11009-019-09726-4.