Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities.

We study structure, eigenvalue spectra, and random-walk dynamics in a wide class of networks with subgraphs (modules) at mesoscopic scale. The networks are grown within the model with three parameters controlling the number of modules, their internal structure as scale-free and correlated subgraphs, and the topology of connecting network. Within the exhaustive spectral analysis for both the adjacency matrix and the normalized Laplacian matrix we identify the spectral properties, which characterize the mesoscopic structure of sparse cyclic graphs and trees. The minimally connected nodes, the clustering, and the average connectivity affect the central part of the spectrum. The number of distinct modules leads to an extra peak at the lower part of the Laplacian spectrum in cyclic graphs. Such a peak does not occur in the case of topologically distinct tree subgraphs connected on a tree whereas the associated eigenvectors remain localized on the subgraphs both in trees and cyclic graphs. We also find a characteristic pattern of periodic localization along the chains on the tree for the eigenvector components associated with the largest eigenvalue lambda(L)=2 of the Laplacian. Further differences between the cyclic modular graphs and trees are found by the statistics of random walks return times and hitting patterns at nodes on these graphs. The distribution of first-return times averaged over all nodes exhibits a stretched exponential tail with the exponent sigma approximately 1/3 for trees and sigma approximately 2/3 for cyclic graphs, which is independent of their mesoscopic and global structure.

[1]  E. B. Wilson.  PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES. , 1919, Science.

[2]  S. Edwards,et al.  The eigenvalue spectrum of a large symmetric random matrix , 1976 .

[3]  Rodgers,et al.  Diffusion in a sparsely connected space: A model for glassy relaxation. , 1988, Physical review. B, Condensed matter.

[4]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[5]  J. Herskowitz,et al.  Proceedings of the National Academy of Sciences, USA , 1996, Current Biology.

[6]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[7]  David C. Bell,et al.  Centrality measures for disease transmission networks , 1999, Soc. Networks.

[8]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[9]  B. Tadić.  Dynamics of directed graphs: the world-wide Web , 2000, cond-mat/0011442.

[10]  A. Barabasi,et al.  Spectra of "real-world" graphs: beyond the semicircle law. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  B. Tadić.  Adaptive random walks on the class of Web graphs , 2001, cond-mat/0110033.

[12]  K. Goh,et al.  Spectra and eigenvectors of scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[14]  Alexandre Arenas,et al.  Optimal network topologies for local search with congestion , 2002, Physical review letters.

[15]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[16]  D. Stauffer,et al.  Ferromagnetic phase transition in Barabási–Albert networks , 2001, cond-mat/0112312.

[17]  S. N. Dorogovtsev,et al.  Spectra of complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Haijun Zhou.  Distance, dissimilarity index, and network community structure. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  A. Arenas,et al.  Community analysis in social networks , 2004 .

[20]  M. A. Muñoz,et al.  Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Detecting network communities: a new systematic and efficient algorithm , 2004 .

[21]  Random walks and geometry : proceedings of a workshop at the Erwin Schrödinger Institute, Vienna, June 18-July 13, 2001 , 2004 .

[22]  Massimo Marchiori,et al.  Method to find community structures based on information centrality. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  M. Newman.  Analysis of weighted networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[25]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[26]  G. J. Rodgers,et al.  INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND GENERAL J. Phys. A: Math. Gen. 38 (2005) 9431–9437 doi:10.1088/0305-4470/38/43/003 Eigenvalue spectra of complex networks , 2005 .

[27]  Bosiljka Tadić,et al.  Search and topology aspects in transport on scale-free networks , 2005 .

[28]  Alex Arenas,et al.  Synchronization reveals topological scales in complex networks. , 2006, Physical review letters.

[29]  Leon Danon,et al.  The effect of size heterogeneity on community identification in complex networks , 2006, physics/0601144.

[30]  J. Kurths,et al.  Hierarchical synchronization in complex networks with heterogeneous degrees. , 2006, Chaos.

[31]  Dale Schuurmans,et al.  Web Communities Identification from Random Walks , 2006, PKDD.

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

[33]  E A Leicht,et al.  Mixture models and exploratory analysis in networks , 2006, Proceedings of the National Academy of Sciences.

[34]  G. J. Rodgers,et al.  Preferential behaviour and scaling in diffusive dynamics on networks , 2007, cond-mat/0701785.

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

[36]  J. Bascompte,et al.  The modularity of pollination networks , 2007, Proceedings of the National Academy of Sciences.

[37]  J. A. Almendral,et al.  Dynamical and spectral properties of complex networks , 2007, 0705.3216.

[38]  Anirban Banerjee,et al.  Spectral plot properties: Towards a qualitative classification of networks , 2008, Networks Heterog. Media.

[39]  S. N. Dorogovtsev,et al.  Laplacian spectra of, and random walks on, complex networks: are scale-free architectures really important? , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Jürgen Kurths,et al.  Lectures in Supercomputational Neurosciences , 2008 .

[41]  Albert Díaz-Guilera,et al.  Dynamics towards synchronization in hierarchical networks , 2008 .

[42]  Milan Rajkovic,et al.  Simplicial Complexes of Networks and Their Statistical Properties , 2008, ICCS.

[43]  Michael Menzinger,et al.  Laplacian spectra as a diagnostic tool for network structure and dynamics. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[44]  Marija Mitrovic,et al.  Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods , 2008, ICCS.

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

[46]  M. Mézard,et al.  Journal of Statistical Mechanics: Theory and Experiment , 2011 .