Asymptotic behavior of the node degrees in the ensemble average of adjacency matrix
arXiv:1512.00553 · doi:10.1017/nws.2016.10
Abstract
Various important and useful quantities or measures that characterize the topological network structure are usually investigated for a network, then they are averaged over the samples. In this paper, we propose an explicit representation by the beforehand averaged adjacency matrix over samples of growing networks as a new general framework for investigating the characteristic quantities. It is applied to some network models, and shows a good approximation of degree distribution asymptotically. In particular, our approach will be applicable through the numerical calculations instead of intractable theoretical analysises, when the time-course of degree is a monotone increasing function like power-law or logarithm.
arXiv comment13 paghes, 7 figures
References in corpus (10)
- Emergence of scaling in random networks
- Error and attack tolerance of complex networks
- Assortative mixing in networks
- Mean-field theory for scale-free random networks
- Mitigation of Malicious Attacks on Networks
- Are randomly grown graphs really random?
- Infinite-Order Percolation and Giant Fluctuations in a Protein Interaction Network
- Robustness of onion-like correlated networks against targeted attacks
- Onion structure and network robustness
- Growing Self-organized Design of Efficient and Robust Complex Networks