Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T01:22:42.445Z Has data issue: false hasContentIssue false
  • English
  • Français

Asymptotic behavior of the node degrees in the ensemble average of adjacency matrix

Published online by Cambridge University Press:  18 July 2016

YUKIO HAYASHI
YUKIO HAYASHI*
Affiliation:
Japan Advanced Institute of Science and Technology, Ishikawa, Japan (e-mail: yhayashi@jaist.ac.jp)
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.

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 analyses, when the time-course of degree is a monotone increasing function like power law or logarithm.

Keywords

ensemble averagegrowing networksdegree distributiondegree–degree correlations

Information

Type
Research Article
Information
Network Science , Volume 4 , Issue 3 , September 2016, pp. 385 - 399
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
Copyright © Cambridge University Press 2016

References

Albert, R., Jeong, H. & Babarási, A.-L. (2000). Error and attack tolerance of complex networks. Nature, 406 (6794), 378–382.CrossRefGoogle ScholarPubMed
Babarási, A.-L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286 (5439), 509–512.Google Scholar
Babarási, A.-L., Albert, R., & Jeong, H. (1999). Mean-field theory for scale-free random networks. Physica A, 272 (1–2), 173–187.Google Scholar
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001). Are randomly grown graphs really random?. Physical Review E, 64 (4), 041902.CrossRefGoogle ScholarPubMed
Hayashi, Y. (2014). Growing self-organized design of efficient and robust complex networks. Proc. of 2014 IEEE 8th Int. Conf. on SASO: Self-Adaptive and Self-Organizing Systems, pp. 50–59. IEEE Xplore Digital Library, http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7001000, http://arxiv.org/abs/1411.7719 Google Scholar
Herrmann, H. J., Schneider, C. M., Moreira, A. A., Andrade, J. S. Jr., & Havlin, S. (2011). Onion-like network topology enhances robustness against malicious attacks. Journal of Statistical Mechanics, Issue 01 P01027, doi: 10.1088/1742-5468/2011/01/P01027.Google Scholar
Kim, J., Krapivsky, P. L., & Redner, S. (2002). Infinite-order percolation and giant fluctuations in a protein interaction networks. Physical Review E, 66 (5), 055101(R).Google Scholar
Newman, M. E. J. (2003). Assortative mixing in networks. Physical Review Letters 89 (20), 208701.Google Scholar
Newman, M. E. J. (2010). Networks - an introduction. Oxford University Press, New York.Google Scholar
Pastor-Satorras, R., Smith, E., & Sole, R. V. (2003). Evolving protein interaction networks through gene duplication. Journal of Theoretical Biology, 222 (2), 199–210.Google Scholar
Schneider, C. M., Moreira, A. A., Andrade, J. S. Jr., Havlin, S., & Herrmann, H. J. (2011). Mitigation of malicious attacks on networks. Proceedings of the National Academy of Sciences of the United States of America, 108 (10), 3838–3841.CrossRefGoogle ScholarPubMed
Sole, R. V., Pastor-Satorras, R., Smith, E., & Kepler, T. B. (2002). A model of large-scale proteome evolution. Advances in Complex Systems, 5 (1), 43–54.CrossRefGoogle Scholar
Tanizawa, T., Havlin, S., & Stanley, H. E. (2012). Robustness of onionlike correlated networks against targeted attacks. Physical Review E, 85 (4), 046109.CrossRefGoogle ScholarPubMed
Wu, Z.-X., & Holme, P. (2011). Onion structure and network robustness. Physical Review E, 84 (2), 026106.Google Scholar