Tree-Like Structure in Large Social and Information Networks

Although large social and information networks are often thought of as having hierarchical or tree-like structure, this assumption is rarely tested. We have performed a detailed empirical analysis of the tree-like properties of realistic informatics graphs using two very different notions of tree-likeness: Gromov's d-hyperbolicity, which is a notion from geometric group theory that measures how tree-like a graph is in terms of its metric structure, and tree decompositions, tools from structural graph theory which measure how tree-like a graph is in terms of its cut structure. Although realistic informatics graphs often do not have meaningful tree-like structure when viewed with respect to the simplest and most popular metrics, e.g., the value of d or the tree width, we conclude that many such graphs do have meaningful tree-like structure when viewed with respect to more refined metrics, e.g., a size-resolved notion of d or a closer analysis of the tree decompositions. We also show that, although these two rigorous notions of tree-likeness capture very different tree-like structures in worst-case, for realistic informatics graphs they empirically identify surprisingly similar structure. We interpret this tree-like structure in terms of the recently-characterized "nested core-periphery" property of large informatics graphs, and we show that the fast and scalable k-core heuristic can be used to identify this tree-like structure.

[1]  Pol Colomer-de-Simon,et al.  Deciphering the global organization of clustering in real complex networks , 2013, Scientific Reports.

[2]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[3]  Timothy A. Davis,et al.  Algorithm 837: AMD, an approximate minimum degree ordering algorithm , 2004, TOMS.

[4]  R. Tarjan,et al.  The analysis of a nested dissection algorithm , 1987 .

[5]  M. Newman,et al.  Coauthorship and citation patterns in the Physical Review. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[8]  Graham A. Niblo.  METRIC SPACES OF NON‐POSITIVE CURVATURE (Grundlehren der Mathematischen Wissenschaften 319) , 2001 .

[9]  M. Bridson,et al.  Metric Spaces of Non-Positive Curvature , 1999 .

[10]  Blair D. Sullivan,et al.  Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity , 2013, IWOMP.

[11]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[12]  Edmond A. Jonckheere,et al.  Scaled Gromov hyperbolic graphs , 2008, J. Graph Theory.

[13]  Laurent Viennot,et al.  Treewidth and Hyperbolicity of the Internet , 2011, 2011 IEEE 10th International Symposium on Network Computing and Applications.

[14]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[15]  Robin Thomas,et al.  Call routing and the ratcatcher , 1994, Comb..

[16]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[17]  Vladimir Batagelj,et al.  An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[18]  H. Markowitz.  The Elimination form of the Inverse and its Application to Linear Programming , 1957 .

[19]  Alessandro Vespignani,et al.  Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.

[20]  Yuval Shavitt,et al.  Hyperbolic embedding of internet graph for distance estimation and overlay construction , 2008, TNET.

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

[22]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

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

[24]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

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

[26]  M. Habib,et al.  Notes on diameters , centers , and approximating trees of δ-hyperbolic geodesic spaces and graphs , 2008 .

[27]  Arie M. C. A. Koster,et al.  Branch and Tree Decomposition Techniques for Discrete Optimization , 2005 .

[28]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[29]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[30]  Mark E. J. Newman,et al.  Coauthorship and citation in scientific publishing , 2013, ArXiv.

[31]  Amin Vahdat,et al.  Hyperbolic Geometry of Complex Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Alessandro Vespignani,et al.  K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases , 2005, Networks Heterog. Media.

[33]  B. Mohar,et al.  Graph Minors , 2009 .

[34]  Eyal Amir,et al.  Approximation Algorithms for Treewidth , 2010, Algorithmica.

[35]  A. O. Houcine.  On hyperbolic groups , 2006 .

[36]  Feodor F. Dragan,et al.  Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs , 2008, SCG '08.

[37]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[38]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[39]  Vladimir Batagelj,et al.  Pajek - Analysis and Visualization of Large Networks , 2001, Graph Drawing Software.

[40]  Wei Chen,et al.  On the Hyperbolicity of Small-World and Treelike Random Graphs , 2012, Internet Math..

[41]  Edmond A. Jonckheere,et al.  Scaled Gromov Four-Point Condition for Network Graph Curvature Computation , 2011, Internet Math..

[42]  Iraj Saniee,et al.  Large-scale curvature of networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[43]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..