X-distribution: Retraceable Power-Law Exponent of Complex Networks

Author:

Pandey Pradumn Kumar1,Arya Aikta1,Saxena Akrati2

Affiliation:

1. Indian Institute of Technology, Roorkee, India

2. LIACS, Leiden University, The Netherlands

Abstract

Network modeling has been explored extensively by means of theoretical analysis as well as numerical simulations for Network Reconstruction (NR). The network reconstruction problem requires the estimation of the power-law exponent ( γ ) of a given input network. Thus, the effectiveness of the NR solution depends on the accuracy of the calculation of γ . In this article, we re-examine the degree distribution-based estimation of γ , which is not very accurate due to approximations. We propose X -distribution, which is more accurate as compared to degree distribution. Various state-of-the-art network models, including CPM, NRM, RefOrCite2, BA, CDPAM, and DMS, are considered for simulation purposes, and simulated results support the proposed claim. Further, we apply X -distribution over several real-world networks to calculate their power-law exponents, which differ from those calculated using respective degree distributions. It is observed that X -distributions exhibit more linearity (straight line) on the log-log scale as compared to degree distributions. Thus, X -distribution is more suitable for the evaluation of power-law exponent using linear fitting (on the log-log scale). The MATLAB implementation of power-law exponent ( γ ) calculation using X -distribution for different network models, and the real-world datasets used in our experiments are available here: https://github.com/Aikta-Arya/X-distribution-Retraceable-Power-Law-Exponent-of-Complex-Networks.git

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference28 articles.

1. Aikta Arya and Pradumn Kumar Pandey . 2022. Structural reconstruction of signed social networks . IEEE Transactions on Computational Social Systems ( 2022 ). Aikta Arya and Pradumn Kumar Pandey. 2022. Structural reconstruction of signed social networks. IEEE Transactions on Computational Social Systems (2022).

2. Balanced and Unbalanced Triangle Count in Signed Networks

3. Albert-László Barabási and Réka Albert . 1999. Emergence of scaling in random networks. science 286, 5439 ( 1999 ), 509–512. Albert-László Barabási and Réka Albert. 1999. Emergence of scaling in random networks. science 286, 5439 (1999), 509–512.

4. Densification and structural transitions in networks that grow by node copying

5. Competition and multiscaling in evolving networks

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3