Finding and evaluating the hierarchical structure in complex networks

A number of recent studies have focused on a statistical property of networked systems—the hierarchical structure. The problem of detecting and characterizing the hierarchical structure has recently attracted considerable attention. In this paper, it is rewritten as optimization in terms of the eigenvalues and eigenvectors. Based on that, an algorithm for reconstructing the hierarchical structure of complex networks is proposed. It is tested on some real-world graphs and is found to offer high sensitivity and reliability.

[1]  Phillip Bonacich,et al.  Eigenvector-like measures of centrality for asymmetric relations , 2001, Soc. Networks.

[2]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[3]  Julio M. Ottino,et al.  Complex networks , 2004, Encyclopedia of Big Data.

[4]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[5]  kc claffy,et al.  Internet topology: connectivity of IP graphs , 2001, SPIE ITCom.

[6]  M. Barthelemy.  Betweenness centrality in large complex networks , 2003, cond-mat/0309436.

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

[8]  Britta Ruhnau,et al.  Eigenvector-centrality - a node-centrality? , 2000, Soc. Networks.

[9]  Hod Lipson,et al.  Networks, dynamics, and modularity. , 2004, Physical review letters.

[10]  Chunguang Li,et al.  An evolving network model with community structure , 2005, physics/0510239.

[11]  Béla Bollobás,et al.  Random Graphs , 1985 .

[12]  Michael Doob,et al.  Spectra of graphs , 1980 .

[13]  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 .

[14]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[15]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[16]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

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

[18]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[19]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[21]  Gavin Lowe,et al.  A hierarchy of failures-based models: theory and application , 2005, Theor. Comput. Sci..

[22]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[23]  Y. Moreno,et al.  Epidemic outbreaks in complex heterogeneous networks , 2001, cond-mat/0107267.