Graph Distance from the Topological View of Non-backtracking Cycles

Whether comparing networks to each other or to random expectation, measuring dissimilarity is essential to understanding the complex phenomena under study. However, determining the structural dissimilarity between networks is an ill-defined problem, as there is no canonical way to compare two networks. Indeed, many of the existing approaches for network comparison differ in their heuristics, efficiency, interpretability, and theoretical soundness. Thus, having a notion of distance that is built on theoretically robust first principles and that is interpretable with respect to features ubiquitous in complex networks would allow for a meaningful comparison between different networks. Here we introduce a theoretically sound and efficient new measure of graph distance, based on the "length spectrum" function from algebraic topology, which compares the structure of two undirected, unweighted graphs by considering their non-backtracking cycles. We show how this distance relates to structural features such as presence of hubs and triangles through the behavior of the eigenvalues of the so-called non-backtracking matrix, and we showcase its ability to discriminate between networks in both real and synthetic data sets. By taking a topological interpretation of non-backtracking cycles, this work presents a novel application of Topological Data Analysis to the study of complex networks.

[1]  Yaim Cooper.  Properties Determined by the Ihara Zeta Function of a Graph , 2009, Electron. J. Comb..

[2]  Philip S. Yu,et al.  On Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation , 2018, SDM.

[3]  H. Bass.  THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE , 1992 .

[4]  Panos M. Pardalos,et al.  Quantification of network structural dissimilarities , 2017, Nature Communications.

[5]  J. Friedman,et al.  THE NON-BACKTRACKING SPECTRUM OF THE UNIVERSAL COVER OF A GRAPH , 2007, 0712.0192.

[6]  K. Sneppen,et al.  Specificity and Stability in Topology of Protein Networks , 2002, Science.

[7]  Victor M. Preciado,et al.  Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks , 2011, IEEE Transactions on Automatic Control.

[8]  Christos Faloutsos,et al.  Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..

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

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

[11]  Danai Koutra,et al.  Network similarity via multiple social theories , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[12]  Edwin R. Hancock,et al.  Graph Characterization via Ihara Coefficients , 2011, IEEE Transactions on Neural Networks.

[13]  Stratis Ioannidis,et al.  A Family of Tractable Graph Distances , 2018, SDM.

[14]  Kevin P. Murphy,et al.  Machine learning - a probabilistic perspective , 2012, Adaptive computation and machine learning series.

[15]  Laurent Massoulié,et al.  Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs , 2014, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[16]  Samir Chowdhury,et al.  Distances and Isomorphism between Networks and the Stability of Network Invariants , 2017, ArXiv.

[17]  R. Ho.  Algebraic Topology , 2022 .

[18]  Tina Eliassi-Rad,et al.  A Guide to Selecting a Network Similarity Method , 2014, SDM.

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

[20]  D. Constantine,et al.  Marked length rigidity for one-dimensional spaces , 2003, Journal of Topology and Analysis.

[21]  Xiao Zhang,et al.  Localization and centrality in networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Chiara Orsini,et al.  Hyperbolic graph generator , 2015, Comput. Phys. Commun..

[23]  Samir Chowdhury,et al.  The Metric Space of Networks , 2018, ArXiv.

[24]  Florent Krzakala,et al.  Spectral density of the non-backtracking operator on random graphs , 2014, ArXiv.

[25]  Kimball Martin,et al.  Distinguishing graphs with zeta functions and generalized spectra , 2014, 1410.1610.

[26]  Yiming Yang,et al.  Introducing the Enron Corpus , 2004, CEAS.

[27]  Length and Eigenvalue Equivalence , 2006, math/0606343.

[28]  Svetlana Markovic,et al.  Spectral Moments of the Edge Adjacency Matrix in Molecular Graphs. Benzenoid Hydrocarbons , 1999, J. Chem. Inf. Comput. Sci..

[29]  Philip Matchett Wood,et al.  Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph , 2017, Comb. Probab. Comput..

[30]  Jukka-Pekka Onnela,et al.  Taxonomies of networks from community structure. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[32]  K. Hashimoto.  Zeta functions of finite graphs and representations of p-adic groups , 1989 .

[33]  Ernesto Estrada,et al.  Spectral Moments of the Edge Adjacency Matrix in Molecular Graphs, 1. Definition and Applications to the Prediction of Physical Properties of Alkanes , 1996, J. Chem. Inf. Comput. Sci..

[34]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

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

[36]  Tamara G. Kolda,et al.  An in-depth analysis of stochastic Kronecker graphs , 2011, JACM.

[37]  Vladimir Batagelj,et al.  Fast algorithms for determining (generalized) core groups in social networks , 2011, Adv. Data Anal. Classif..

[38]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[39]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[40]  Laurent Massoulié,et al.  Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models , 2017, ITCS.

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

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

[43]  James P. Bagrow,et al.  An information-theoretic, all-scales approach to comparing networks , 2018, Applied Network Science.

[44]  Audrey Terras,et al.  Zeta Functions of Graphs: A Stroll through the Garden , 2010 .

[45]  Danai Koutra,et al.  DELTACON: A Principled Massive-Graph Similarity Function , 2013, SDM.

[46]  Ramana Rao Kompella,et al.  Network Sampling: From Static to Streaming Graphs , 2012, TKDD.