How Many Nodes are Effectively Accessed in Complex Networks?

The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility, including its relationship with the average minimal time to visit all nodes reachable after h steps along a random walk starting from a source, as well as the number of nodes that are visited after a finite period of time. We characterize the relationship between accessibility and the average number of walks required in order to visit all reachable nodes (the exploration time), conjecture that the maximum accessibility implies the minimal exploration time, and confirm the relationship between the accessibility values and the number of nodes visited after a basic time unit. The latter relationship is investigated with respect to three types of dynamics, namely: traditional random walks, self-avoiding random walks, and preferential random walks.

[1]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  L. D. Costa,et al.  Connectivity and dynamics of neuronal networks as defined by the shape of individual neurons , 2008, 0805.1640.

[3]  L. D. Costa,et al.  On the efficiency of transportation systems in large cities , 2010 .

[4]  L. D. Costa,et al.  Accessibility in complex networks , 2008 .

[5]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  A. Barabasi,et al.  Global organization of metabolic fluxes in the bacterium Escherichia coli , 2004, Nature.

[7]  Filipi Nascimento Silva,et al.  Hierarchical Characterization of Complex Networks , 2004, cond-mat/0412761.

[8]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[9]  L. D. Costa,et al.  Identifying the borders of mathematical knowledge , 2010 .

[10]  Marcus Kaiser,et al.  Spatial growth of real-world networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Thomas Sauerwald,et al.  The Weighted Coupon Collector's Problem and Applications , 2009, COCOON.

[12]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[13]  Petter Holme,et al.  Congestion and Centrality in Traffic Flow on Complex Networks , 2003, Adv. Complex Syst..

[14]  A. Barabasi,et al.  Dynamics of information access on the web. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Alessandro Vespignani,et al.  Characterization and modeling of weighted networks , 2005 .

[16]  A. Arenas,et al.  Dynamical properties of model communication networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  J. Kert'esz,et al.  Failures and avalanches in complex networks , 2006, cond-mat/0605461.

[18]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[19]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[20]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[21]  M. Hofri,et al.  The coupon-collector problem revisited — a survey of engineering problems and computational methods , 1997 .

[22]  Hawoong Jeong,et al.  Googling Social Interactions: Web Search Engine Based Social Network Construction , 2007, PloS one.

[23]  Arjen K. Lenstra.  Birthday Paradox , 2011, Encyclopedia of Cryptography and Security.

[24]  Luciano da Fontoura Costa,et al.  Modeling worldwide highway networks , 2009 .

[25]  G. J. Rodgers,et al.  Transport on Complex Networks: Flow, Jamming and Optimization , 2007, Int. J. Bifurc. Chaos.

[26]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[27]  Daniel O. Cajueiro,et al.  Optimal navigation for characterizing the role of the nodes in complex networks , 2010 .

[28]  Peter Donnelly,et al.  Superfamilies of Evolved and Designed Networks , 2004 .

[29]  Lucas Antiqueira,et al.  Structure-Dynamics Interplay in Directed Complex Networks with Border Effects , 2010, CompleNet.

[30]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[31]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[32]  L. Gallos,et al.  Absence of kinetic effects in reaction-diffusion processes in scale-free networks. , 2004, Physical review letters.

[33]  L. D. Costa,et al.  Chain motifs: the tails and handles of complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Balázs Kozma,et al.  Diffusion processes on power-law small-world networks. , 2005, Physical review letters.

[35]  Bruno A. N. Travençolo,et al.  Characterizing topological and dynamical properties of complex networks without border effects , 2010 .

[36]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .