» Articles » PMID: 28790321

Reliable Multi-Fractal Characterization of Weighted Complex Networks: Algorithms and Implications

Overview
Journal Sci Rep
Specialty Science
Date 2017 Aug 10
PMID 28790321
Citations 33
Authors
Affiliations
Soon will be listed here.
Abstract

Through an elegant geometrical interpretation, the multi-fractal analysis quantifies the spatial and temporal irregularities of the structural and dynamical formation of complex networks. Despite its effectiveness in unweighted networks, the multi-fractal geometry of weighted complex networks, the role of interaction intensity, the influence of the embedding metric spaces and the design of reliable estimation algorithms remain open challenges. To address these challenges, we present a set of reliable multi-fractal estimation algorithms for quantifying the structural complexity and heterogeneity of weighted complex networks. Our methodology uncovers that (i) the weights of complex networks and their underlying metric spaces play a key role in dictating the existence of multi-fractal scaling and (ii) the multi-fractal scaling can be localized in both space and scales. In addition, this multi-fractal characterization framework enables the construction of a scaling-based similarity metric and the identification of community structure of human brain connectome. The detected communities are accurately aligned with the biological brain connectivity patterns. This characterization framework has no constraint on the target network and can thus be leveraged as a basis for both structural and dynamic analysis of networks in a wide spectrum of applications.

Citing Articles

GraphBNC: Machine Learning-Aided Prediction of Interactions Between Metal Nanoclusters and Blood Proteins.

Pihlajamaki A, Matus M, Malola S, Hakkinen H Adv Mater. 2024; 36(47):e2407046.

PMID: 39318073 PMC: 11586822. DOI: 10.1002/adma.202407046.


Fractal Similarity of Pain Brain Networks.

Fauchon C, Bastuji H, Peyron R, Garcia-Larrea L Adv Neurobiol. 2024; 36:639-657.

PMID: 38468056 DOI: 10.1007/978-3-031-47606-8_32.


GAHLS: an optimized graph analytics based high level synthesis framework.

Xiao Y, Nazarian S, Bogdan P Sci Rep. 2023; 13(1):22655.

PMID: 38114657 PMC: 10730867. DOI: 10.1038/s41598-023-48981-x.


A unified approach of detecting phase transition in time-varying complex networks.

Znaidi M, Sia J, Ronquist S, Rajapakse I, Jonckheere E, Bogdan P Sci Rep. 2023; 13(1):17948.

PMID: 37864007 PMC: 10589276. DOI: 10.1038/s41598-023-44791-3.


Multifractality of Complex Networks Is Also Due to Geometry: A Geometric Sandbox Algorithm.

Rak R, Rak E Entropy (Basel). 2023; 25(9).

PMID: 37761623 PMC: 10527770. DOI: 10.3390/e25091324.


References
1.
Song C, Havlin S, Makse H . Self-similarity of complex networks. Nature. 2005; 433(7024):392-5. DOI: 10.1038/nature03248. View

2.
Dobson C . Protein folding and misfolding. Nature. 2003; 426(6968):884-90. DOI: 10.1038/nature02261. View

3.
Barabasi , ALBERT . Emergence of scaling in random networks. Science. 1999; 286(5439):509-12. DOI: 10.1126/science.286.5439.509. View

4.
Wei D, Liu Q, Zhang H, Hu Y, Deng Y, Mahadevan S . Box-covering algorithm for fractal dimension of weighted networks. Sci Rep. 2013; 3:3049. PMC: 6505717. DOI: 10.1038/srep03049. View

5.
Rozenfeld H, Song C, Makse H . Small-world to fractal transition in complex networks: a renormalization group approach. Phys Rev Lett. 2010; 104(2):025701. DOI: 10.1103/PhysRevLett.104.025701. View