Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-29T15:13:55.093Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Part of: Combinatorial probability Operations research and management science

Published online by Cambridge University Press:  24 March 2016

Panpan Zhang  and
Hosam Mahmoud
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.
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

Random structurenetworkrandom graphself-similaritydegree profilephase transitionstochastic recurrencePólya urnmartingale

MSC classification

Primary: 90B15: Network models, stochastic
Secondary: 60C05: Combinatorial probability
Type
Research Article
Information
Advances in Applied Probability , Volume 48 , Issue 1 , March 2016 , pp. 163 - 175
Copyright
Copyright © Applied Probability Trust 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]AndradeJ. S., Jr. J. S., Jr., Herrmann, H. J., Andrade, R. F. S. and da Silva, L. R. (2005). Apollonian networks: simultaneously scale-free, small world, Euclidean, space filling, and with matching graphs. Phys. Rev. Lett. 94, 018702. (Erratum: 102 (2009), 079901.) CrossRefGoogle ScholarPubMed
[2]Athreya, K. B. and Karlin, S. (1968). Embedding of urn schemes into continuous time Markov branching processes and related limit theorems. Ann. Math. Statist. 39, 1801–1817. Google Scholar
[3]Bagchi, A. and Pal, A. K. (1985). Asymptotic normality in the generalized Pólya–Eggenberger urn model, with an application to computer data structures. SIAM J. Algebraic Discrete Methods 6, 394–405. Google Scholar
[4]Cooper, C. and Frieze, A. (2015). Long paths in random Apollonian networks. Internet Math. 11, 308–318. CrossRefGoogle Scholar
[5]Cooper, C., Frieze, A. and Uehara, R. (2014). The height of random k-trees and related branching processes. Random Structures Algorithms 45, 675–702. CrossRefGoogle Scholar
[6]Ebrahimzadeh, E.et al. (2013). On the longest paths and the diameter in random Apollonian networks. Electron. Notes Discrete Math. 43, 355–365. Google Scholar
[7]Flajolet, P., Dumas, P. and Puyhaubert, V. (2006). Some exactly solvable models of urn process theory. In Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Conmbinatorics and Probabilities, Association of Discrete Mathematics and Theoretical Computer Science, Nancy, pp. 59–118. Google Scholar
[8]Freedman, D. A. (1965). Bernard Friedman's urn. Ann. Math. Statist. 36, 956–970. Google Scholar
[9]Frieze, A. and Tsourakakis, C. E. (2012). On certain properties of random Apollonian networks. In Algorithms and Models for the Web Graph (Proc. WAW 2012), Springer, Berlin, pp. 93–112. CrossRefGoogle Scholar
[10]Graham, R. L., Knuth, D. E. and Patashnik, O. (1994). Concrete Mathematics, 2nd edn. Addison-Wesley, Reading, MA. Google Scholar
[11]Hall, P. and Heyde, C. C. (1980). Martingale Limit Theory and Its Application. Academic Press, New York. Google Scholar
[12]Harary, F. and Palmer, E. M. (1968). On acyclic simplical complexes. Mathematika 15, 115–122. CrossRefGoogle Scholar
[13]Janson, S. (2005). Asymptotic degree distribution in random recursive trees. Random Structures Algorithms 26, 69–83. Google Scholar
[14]Janson, S. (2006). Limit theorems for triangular urn schemes. Prob. Theory Relat. Fields 134, 417–452. CrossRefGoogle Scholar
[15]Janson, S. (2010). Moments of gamma type and the Brownian supremum process area. Prob. Surveys 7, 1–52, 207–208. Google Scholar
[16]Kuba, M. and Panholzer, A. (2007). On the degree distribution of the nodes in increasing trees. J. Combin. Theory A 114, 597–618. CrossRefGoogle Scholar
[17]Panholzer, A. and Seitz, G. (2014). Ancestors and descendants in evolving k-tree models. Random Structures Algorithms 44, 465–489. CrossRefGoogle Scholar
[18]Smythe, R. T. and Mahmoud, H. M. (1996). A survey of recursive trees. Theory Prob. Math. Statist. 51, 1–27. Google Scholar
[19]Zhang, P., Chen, C. and Mahmoud, H. (2015). Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach. Statist. Prob. Lett. 96, 149–153. Google Scholar