Structural Analysis of Networks

Network analysis naturally relies on graph theory and, more particularly, on the use of node and edge metrics to identify the salient properties in graphs. When building visual maps of networks, these metrics are turned into useful visual cues or are used interactively to filter out parts of a graph while querying it, for instance. Over the years, analysts from different application domains have designed metrics to serve specific needs. Network science is an inherently cross-disciplinary field, which leads to the publication of metrics with similar goals; different names and descriptions of their analytics often mask the similarity between two metrics that originated in different fields. Here, we study a set of graph metrics and compare their relative values and behaviors in an effort to survey their potential contributions to the spatial analysis of networks.

[1]  Guy Melançon,et al.  Multiscale visualization of small world networks , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).

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

[3]  P. Jaccard.  Distribution de la flore alpine dans le bassin des Dranses et dans quelques régions voisines , 1901 .

[4]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[5]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[6]  C. Dangalchev.  Residual closeness in networks , 2006 .

[7]  Frank Harary,et al.  Status and Contrastatus , 1959 .

[8]  B. Bollobás.  The evolution of random graphs , 1984 .

[9]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[10]  Guy Melançon,et al.  Edge Metrics for Visual Graph Analytics: A Comparative Study , 2008, 2008 12th International Conference Information Visualisation.

[11]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

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

[13]  F. Harary,et al.  Eccentricity and centrality in networks , 1995 .

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

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

[16]  T. Valente,et al.  Integration and radiality: Measuring the extent of an individual's connectedness and reachability in a network , 1998 .

[17]  M. A. Beauchamp.  AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.

[18]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[19]  J. Anthonisse.  The rush in a directed graph , 1971 .

[20]  G. Melançon,et al.  Réseaux Multi-Niveaux : L'Exemple des Echanges Aériens Mondiaux de Passagers , 2005 .

[21]  R. Guimerà,et al.  The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[22]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[23]  A. Shimbel.  Structural parameters of communication networks , 1953 .

[24]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[25]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[26]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Ulrik Brandes,et al.  Engineering graph clustering: Models and experimental evaluation , 2008, JEAL.