The subnetwork investigation of scale-free networks based on the self-similarity

Wenting Wang, Shijie Shi and Xianghua Fu

Chaos, Solitons & Fractals, 2022, vol. 161, issue C

Abstract: The scale-free network with self-similarity is an essential data structure widely used in social networks and bioinformatics. The subnetwork investigation of large-scale networks has attracted attention in many applications. Traditional methods are computationally complexity and time-consuming. A new methodology needs to handle the computational complexity challenge from large-scale network datasets. In this paper, we develop a series of edge-based subnetwork investigation algorithms: HEPS-1 and HEPS-2. We investigate the relations between edges and their edge neighbours caused by the reconcile of scale-free and self-similarity. Then, we determine the edges for the subnetwork. In this way, we sample the networks while keeping the original statistical characters. The computational complexity is low. The effectiveness of sampling is enhanced.

Keywords: Subnetwork; Network sampling; Self-similarity; Scale-free network (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077922003502
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:161:y:2022:i:c:s0960077922003502

DOI: 10.1016/j.chaos.2022.112140

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().