Literature DB >> 19905178

Structure of shells in complex networks.

Jia Shao1, Sergey V Buldyrev, Lidia A Braunstein, Shlomo Havlin, H Eugene Stanley.   

Abstract

We define shell l in a network as the set of nodes at distance l with respect to a given node and define rl as the fraction of nodes outside shell l . In a transport process, information or disease usually diffuses from a random node and reach nodes shell after shell. Thus, understanding the shell structure is crucial for the study of the transport property of networks. We study the statistical properties of the shells of a randomly chosen node. For a randomly connected network with given degree distribution, we derive analytically the degree distribution and average degree of the nodes residing outside shell l as a function of rl. Further, we find that rl follows an iterative functional form rl=phi(rl-1) , where phi is expressed in terms of the generating function of the original degree distribution of the network. Our results can explain the power-law distribution of the number of nodes Bl found in shells with l larger than the network diameter d , which is the average distance between all pairs of nodes. For real-world networks the theoretical prediction of rl deviates from the empirical rl. We introduce a network correlation function c(rl) identical with rl/phi(rl-1) to characterize the correlations in the network, where rl is the empirical value and phi(rl-1) is the theoretical prediction. c(rl)=1 indicates perfect agreement between empirical results and theory. We apply c(rl) to several model and real-world networks. We find that the networks fall into two distinct classes: (i) a class of poorly connected networks with c(rl)>1 , where a larger (smaller) fraction of nodes resides outside (inside) distance l from a given node than in randomly connected networks with the same degree distributions. Examples include the Watts-Strogatz model and networks characterizing human collaborations such as citation networks and the actor collaboration network; (ii) a class of well-connected networks with c(rl)<1 . Examples include the Barabási-Albert model and the autonomous system Internet network.

Entities:  

Mesh:

Year:  2009        PMID: 19905178     DOI: 10.1103/PhysRevE.80.036105

Source DB:  PubMed          Journal:  Phys Rev E Stat Nonlin Soft Matter Phys        ISSN: 1539-3755


  7 in total

1.  Catastrophic cascade of failures in interdependent networks.

Authors:  Sergey V Buldyrev; Roni Parshani; Gerald Paul; H Eugene Stanley; Shlomo Havlin
Journal:  Nature       Date:  2010-04-15       Impact factor: 49.962

2.  Critical effect of dependency groups on the function of networks.

Authors:  Roni Parshani; Sergey V Buldyrev; Shlomo Havlin
Journal:  Proc Natl Acad Sci U S A       Date:  2010-12-29       Impact factor: 11.205

3.  Sustainable online communities exhibit distinct hierarchical structures across scales of size.

Authors:  Yaniv Dover; Jacob Goldenberg; Daniel Shapira
Journal:  Proc Math Phys Eng Sci       Date:  2020-07-01       Impact factor: 2.704

4.  Age-Stratified COVID-19 Spread Analysis and Vaccination: A Multitype Random Network Approach.

Authors:  Xianhao Chen; Guangyu Zhu; Lan Zhang; Yuguang Fang; Linke Guo; Xinguang Chen
Journal:  IEEE Trans Netw Sci Eng       Date:  2021-04-27

5.  Quantifying loopy network architectures.

Authors:  Eleni Katifori; Marcelo O Magnasco
Journal:  PLoS One       Date:  2012-06-06       Impact factor: 3.240

6.  Localized recovery of complex networks against failure.

Authors:  Yilun Shang
Journal:  Sci Rep       Date:  2016-07-26       Impact factor: 4.379

7.  Robustness and Vulnerability of Networks with Dynamical Dependency Groups.

Authors:  Ya-Nan Bai; Ning Huang; Lei Wang; Zhi-Xi Wu
Journal:  Sci Rep       Date:  2016-11-28       Impact factor: 4.379

  7 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.