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

• Hayashi, Yukio

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

identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/14055

Journal

• Network Science

  Network Science 4 (3), 385-399, 2016-09

  Cambridge University Press

Keywords

• emsemble average
• growing networks
• degree distribution
• degree-degree correlation

Details

• CRID: 1050845762468636800
• NII Article ID: 120006027364
• ISSN: 20501242
• ISSN: 20501250
• DOI: 10.1017/nws.2016.10
• Web Site: http://hdl.handle.net/10119/14055
• Web Site: https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S2050124216000102
• Text Lang: en
• Article Type: journal article
• Data Source:
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN