arXiv · cond-mat/0508596
Detrended fluctuation analysis on the correlations of complex networks under attack and repair strategy
Abstract
We analyze the correlation properties of the Erdos-Renyi random graph (RG) and the Barabasi-Albert scale-free network (SF) under the attack and repair strategy with detrended fluctuation analysis (DFA). The maximum degree k_max, representing the local property of the system, shows similar scaling behaviors for random graphs and scale-free networks. The fluctuations are quite random at short time scales but display strong anticorrelation at longer time scales under the same system size N and different repair probability p_re. The average degree , revealing the statistical property of the system, exhibits completely different scaling behaviors for random graphs and scale-free networks. Random graphs display long-range power-law correlations. Scale-free networks are uncorrelated at short time scales; while anticorrelated at longer time scales and the anticorrelation becoming stronger with the increase of p_re.
Explore related subjects
Keep this discovery
L. P. Chi, C. B. Yang, K. Ma, X. Cai. 2005-08-25. Detrended fluctuation analysis on the correlations of complex networks under attack and repair strategy. https://doi.org/10.1088/0253-6102%2F45%2F4%2F038
Cite the original work for its findings. Save a collection to share your selection of sources.