Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-24T09:23:18.535Z Has data issue: false hasContentIssue false
  • English
  • Français

The N-star network evolution model

Part of: Graph theory Stochastic processes

Published online by Cambridge University Press:  30 July 2019

István Fazekas ,
Csaba Noszály  and
Attila Perecsényi
István Fazekas*
Affiliation:
University of Debrecen
Csaba Noszály*
Affiliation:
University of Debrecen
Attila Perecsényi*
Affiliation:
University of Debrecen
*
*Postal address: Faculty of Informatics, University of Debrecen, PO Box 400, 4002 Debrecen, Hungary.
*Postal address: Faculty of Informatics, University of Debrecen, PO Box 400, 4002 Debrecen, Hungary.
*Postal address: Faculty of Informatics, University of Debrecen, PO Box 400, 4002 Debrecen, Hungary.
Get access Rights & Permissions [Opens in a new window]

Abstract

A new network evolution model is introduced in this paper. The model is based on cooperations of N units. The units are the nodes of the network and the cooperations are indicated by directed links. At each evolution step N units cooperate, which formally means that they form a directed N-star subgraph. At each step either a new unit joins the network and it cooperates with N − 1 old units, or N old units cooperate. During the evolution both preferential attachment and uniform choice are applied. Asymptotic power law distributions are obtained both for in-degrees and for out-degrees.

Keywords

Random graphpreferential attachmentscale freepower lawsubmartingaleDoob–Meyer decomposition

MSC classification

Primary: 05C80: Random graphs 60G42: Martingales with discrete parameter
Type
Research Papers
Information
Journal of Applied Probability , Volume 56 , Issue 2 , June 2019 , pp. 416 - 440
Copyright
© Applied Probability Trust 2019 

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

Backhausz, Á. (2012). Analysis of random graphs with methods of martingale theory. Doctoral Thesis, Eötvös Loránd University.Google Scholar
Backhausz, Á. and Mόri, T. F. (2012). A random graph model based on 3-interactions. Ann. Univ. Sci. Budapest. Sect. Comput. 36, 41–52.Google Scholar
Backhausz, Á. and Mόri, T. F. (2014). Weights and degrees in a random graph model based on 3-interactions. Acta Math. Hungar. 143, 23–43.CrossRefGoogle Scholar
Barabási, A. L. (2016). Network Science. Cambridge University Press.Google Scholar
Barabási, A. L. and Albert, R. (1999). Emergence of scaling in random networks. Science 286, 509–512.CrossRefGoogle Scholar
Bollobás, B. and Riordan, O. M. (2003). Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks, pp. 1–34. Wiley-VCH, Weinheim.Google Scholar
Bollobás, B., Riordan, O. M., Spencer, J. and Tusnády, G. (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms 18, 279–290.CrossRefGoogle Scholar
Bosworth, S., Kabay, M.E. and Whyne, E. (eds) (2014). Computer Security Handbook. John Wiley.Google Scholar
Broido, A. D. and Clauset, A. (2018). Scale-free networks are rare. Available at arXiv:1806.03586.Google Scholar
Buckley, P.G. and Osthus, D. (2004). Popularity based random graph models leading to a scale-free degree sequence. Discrete Math. 282, 53–63.CrossRefGoogle Scholar
Chung, F. and Lu, L. (2006). Complex Graphs and Networks. American Mathematical Society, Providence, RI.CrossRefGoogle Scholar
Cooper, C. and Frieze, A. (2003). A general model of web graphs. Random Structures Algorithms 22, 311–335.CrossRefGoogle Scholar
Durrett, R. (2007). Random Graph Dynamics. Cambridge University Press.Google Scholar
Erdés, P. and Rényi, A. (1959). On random graphs. I. Publ. Math. Debrecen 6, 290–297.Google Scholar
Erdés, P. and Rényi, A. (1960). On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17–61.Google Scholar
Fazekas, I. and Porvázsnyik, B. (2016). Limit theorems for the weights and the degrees in an N-interactions random graph model. Open Math. 14, 414–424.CrossRefGoogle Scholar
Fazekas, I. and Porvázsnyik, B. (2016). Scale-free property for degrees and weights in an N-interactions random graph model. J. Math. Sci. 214, 69–82.CrossRefGoogle Scholar
Fazekas, I., Noszály, C. and Perecsényi, A. (2018). A population evolution model and its applications to random networks. Statist. Prob. Lett. 143, 17–27.CrossRefGoogle Scholar
Gilbert, E. N. (1959). Random graphs. Ann. Math. Statist. 30, 1141–1144.CrossRefGoogle Scholar
Holme, P. and Kim, B. J. (2002). Growing scale-free networks with tunable clustering. Phys. Rev. E 65, 026107.CrossRefGoogle Scholar
Mόri, T. F. (2005). The maximum degree of the Barabási–Albert random tree. Combinatorics Prob. Comput. 14, 339–348.CrossRefGoogle Scholar
Neveu, J. (1975). Discrete-Parameter Martingales. North-Holland, Amsterdam.Google Scholar
Ostroumova, L., Ryabchenko, A. and Samosvat, E. (2013). Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient. In Algorithms and Models for the Web Graph (Lecture Notes Comput. Sci. 8305), pp. 185–202. Springer, Cham.CrossRefGoogle Scholar
Prudnikov, A. P., Brychkov, Y. A. and Marichev, O. I. (1986). Integrals and Series. Gordon & Breach Science, New York.Google Scholar
Simon, H. A. (1955). On a class of skew distribution functions. Biometrika 42, 425–440.CrossRefGoogle Scholar
Van der Hofstad, R. (2017). Random Graphs and Complex Networks. Cambridge University Press.CrossRefGoogle Scholar
Yule, G. U. (1925). A mathematical theory of evolution, based on the conclusions of Dr. J. C. Willis, F.R.S. Phil. Trans. R. Soc. London B 213, 21–87.CrossRefGoogle Scholar
Zhou, T., Yan, G. and Wang, B.-H. (2005). Maximal planar networks with large clustering coefficient and power-law degree distribution. Phys. Rev. E 71, 046141. (Correction: 72 (2005), 029905)CrossRefGoogle Scholar