Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T04:10:47.955Z Has data issue: false hasContentIssue false

The degree profile and weight in Apollonian networks and k-trees

Published online by Cambridge University Press:  24 March 2016

Panpan Zhang*
Affiliation:
The George Washington University
Hosam Mahmoud*
Affiliation:
The George Washington University
*
* Postal address: Department of Statistics, The George Washington University, 801 22nd St. NW, Washington, DC 20052, USA.
* Postal address: Department of Statistics, The George Washington University, 801 22nd St. NW, Washington, DC 20052, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We investigate the degree profile and total weight in Apollonian networks. We study the distribution of the degrees of vertices as they age in the evolutionary process. Asymptotically, the (suitably-scaled) degree of a node with a fixed label has a Mittag-Leffler-like limit distribution. The degrees of nodes of later ages have different asymptotic distributions, influenced by the time of their appearance. The very late arrivals have a degenerate distribution. The result is obtained via triangular Pólya urns. Also, via the Bagchi–Pal urn, we show that the number of terminal nodes asymptotically follows a Gaussian law. We prove that the total weight of the network asymptotically follows a Gaussian law, obtained via martingale methods. Similar results carry over to the sister structure of the k-trees, with minor modification in the proof methods, done mutatis mutandis.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2016