Network Distance based on Laplacian Flows on Graphs

Distance plays a fundamental role in measuring similarity between objects. Various visualization techniques and learning tasks in statistics and machine learning such as shape matching, classification, dimension reduction and clustering often rely on some distance or similarity measure. It is of tremendous importance to have a distance that can incorporate the underlying structure of the object. In this paper, we focus on proposing such a distance between network objects. Our key insight is to define a distance based on the long term diffusion behavior of the whole network. We first introduce a dynamic system on graphs called Laplacian flow. Based on this Laplacian flow, a new version of diffusion distance between networks is proposed. We will demonstrate the utility of the distance and its advantage over various existing distances through explicit examples. The distance is also applied to subsequent learning tasks such as clustering network objects.

[1]  Lizhen Lin,et al.  Averages of unlabeled networks: Geometric characterization and asymptotic behavior , 2017, The Annals of Statistics.

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

[3]  Igor Rivin,et al.  Extremal metrics on graphs I , 2000 .

[4]  V. Koltchinskii,et al.  Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results , 2006, math/0612777.

[5]  Cesare Furlanello,et al.  The HIM glocal metric and kernel for network comparison and classification , 2012, 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA).

[6]  Leonidas J. Guibas,et al.  Persistence Barcodes for Shapes , 2005, Int. J. Shape Model..

[7]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[8]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[9]  Andrew W. Moore,et al.  Weighted Spectral Distribution for Internet Topology Analysis: Theory and Applications , 2010, IEEE/ACM Transactions on Networking.

[10]  M. Fréchet.  Les éléments aléatoires de nature quelconque dans un espace distancié , 1948 .

[11]  Stefan Schmid,et al.  Modeling and measuring graph similarity: the case for centrality distance , 2014, FOMC '14.

[12]  David K. Hammond,et al.  Graph diffusion distance: A difference measure for weighted graphs based on the graph Laplacian exponential kernel , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[13]  Ann B. Lee,et al.  Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Anirban Banerjee,et al.  Structural distance and evolutionary relationship of networks , 2008, Biosyst..

[15]  Wolfram Burgard,et al.  Dynamic Coverage Verification in Mobile Sensor Networks via Switched Higher Order Laplacians , 2008 .

[16]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[17]  Tommi S. Jaakkola,et al.  Partially labeled classification with Markov random walks , 2001, NIPS.

[18]  Purnamrita Sarkar,et al.  On clustering network-valued data , 2016, NIPS.

[19]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[20]  B. Nadler,et al.  Diffusion maps, spectral clustering and reaction coordinates of dynamical systems , 2005, math/0503445.

[21]  Jun Li,et al.  Hypothesis Testing For Network Data in Functional Neuroimaging , 2014, 1407.5525.

[22]  Herbert Edelsbrunner,et al.  Topological persistence and simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[23]  Cesare Furlanello,et al.  An introduction to spectral distances in networks , 2010, WIRN.

[24]  B. Pincombe.  Detecting changes in time series of network graphs using minimum mean squared error and cumulative summation , 2007 .

[25]  Ping Zhu,et al.  A study of graph spectra for comparing graphs and trees , 2008, Pattern Recognit..

[26]  Karl Pearson F.R.S..  LIII. On lines and planes of closest fit to systems of points in space , 1901 .

[27]  Alexander S Mikhailov,et al.  Evolutionary reconstruction of networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Steen Moeller,et al.  The Human Connectome Project: A data acquisition perspective , 2012, NeuroImage.

[30]  Rabi Bhattacharya,et al.  NONPARAMETRIC INFERENCE ON NON-EUCLIDEAN SPACES , 2015 .