Author:
Fazekas István,Noszály Csaba,Perecsényi Attila
Abstract
AbstractA 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.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference28 articles.
1. [9] Broido, A. D. and Clauset, A. (2018). Scale-free networks are rare. Available at arXiv:1806.03586.
2. [1] Backhausz, Á . (2012). Analysis of random graphs with methods of martingale theory. Doctoral Thesis, Eötvös Loránd University.
3. Limit theorems for the weights and the degrees in anN-interactions random graph model
4. A general model of web graphs
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献