Comparing large-scale graphs based on quantum probability theory

In this paper, a new measurement to compare two large-scale graphs based on the theory of quantum probability is proposed. An explicit form for the spectral distribution of the corresponding adjacency matrix of a graph is established. Our proposed distance between two graphs is defined as the distance between the corresponding moment matrices of their spectral distributions. It is shown that the spectral distributions of their adjacency matrices in a vector state includes information not only about their eigenvalues, but also about the corresponding eigenvectors. Moreover, we prove that such distance is graph invariant and sub-structure invariant. Examples with various graphs are given, and distances between graphs with few vertices are checked. Computational results for real large-scale networks show that its accuracy is better than any existing methods and time cost is extensively cheap.

[1]  Distance between spectra of graphs , 2015 .

[2]  Jianguo Qian,et al.  Bounds on the number of closed walks in a graph and its applications , 2014 .

[3]  Matthias Dehmer,et al.  Comparing large graphs efficiently by margins of feature vectors , 2007, Appl. Math. Comput..

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

[5]  Gerassimos A. Athanassoulis,et al.  Moment data can be analytically completed , 2003 .

[6]  N. Obata.  Minicourse IV: Asymptotic Spectral Analysis of Growing Graphs —— a quantum probability point of view , 2019 .

[7]  Ernst W. Mayr,et al.  Inequalities for the Number of Walks in Graphs , 2013, Algorithmica.

[8]  Kurt Mehlhorn,et al.  Efficient graphlet kernels for large graph comparison , 2009, AISTATS.

[9]  S. Butler.  A note about cospectral graphs for the adjacency and normalized Laplacian matrices , 2010 .

[10]  Alberto Calderone,et al.  Comparing Alzheimer’s and Parkinson’s diseases networks using graph communities structure , 2016, BMC Systems Biology.

[11]  John Kenneth Morrow,et al.  Molecular networks in drug discovery. , 2010, Critical reviews in biomedical engineering.

[12]  Jon M. Kleinberg,et al.  Subgraph frequencies: mapping the empirical and extremal geography of large graph collections , 2013, WWW.

[13]  Canh Hao Nguyen,et al.  A new dissimilarity measure for comparing labeled graphs , 2013 .

[14]  Matthias Dehmer,et al.  A similarity measure for graphs with low computational complexity , 2006, Appl. Math. Comput..

[15]  Willem H. Haemers,et al.  Cospectral Graphs and the Generalized Adjacency Matrix , 2006 .

[16]  J. B. French.  Elementary Principles of Spectral Distributions , 1980 .

[17]  Minfang Peng,et al.  Global similarity tests of physical designs of circuits: A complex network approach , 2014, Appl. Math. Comput..

[18]  Maliheh Aramon,et al.  A Novel Graph-based Approach for Determining Molecular Similarity , 2016, ArXiv.

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

[20]  Huaiyu Zhu.  On Information and Sufficiency , 1997 .

[21]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[22]  Ping Li,et al.  A new space for comparing graphs , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[23]  Willem H. Haemers,et al.  Enumeration of cospectral graphs , 2004, Eur. J. Comb..

[24]  Zoran Stanić,et al.  Spectral distances of graphs , 2012 .

[25]  David W. Jacobs,et al.  Riemannian Metric Learning for Symmetric Positive Definite Matrices , 2015, ArXiv.

[26]  Jiao Gu,et al.  Spectral distances on graphs , 2015, Discret. Appl. Math..

[27]  D. Fasino,et al.  Recovering a probabilty density from a finite number of moments and local a priori information , 1996 .

[28]  Distance between distance spectra of graphs , 2017 .

[29]  Yongtang Shi,et al.  Fifty years of graph matching, network alignment and network comparison , 2016, Inf. Sci..

[30]  Christian Berg,et al.  A determinant characterization of moment sequences with finitely many mass points , 2015 .

[31]  Miguel Angel Fiol,et al.  Number of walks and degree powers in a graph , 2009, Discret. Math..

[32]  Hironobu Fujii,et al.  Isospectral graphs and isoperimetric constants , 1999, Discret. Math..

[33]  Sun-Yuan Hsieh,et al.  A DNA-based graph encoding scheme with its applications to graph isomorphism problems , 2008, Appl. Math. Comput..

[34]  R. Bhatia,et al.  Riemannian geometry and matrix geometric means , 2006 .

[35]  Distance between the normalized Laplacian spectra of two graphs , 2017 .

[36]  Laura Zager,et al.  Graph similarity and matching , 2005 .

[37]  Subhash C. Basak,et al.  Determining structural similarity of chemicals using graph-theoretic indices , 1988, Discret. Appl. Math..

[38]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[39]  C. T. Ng,et al.  Measures of distance between probability distributions , 1989 .

[40]  R. Bhatia.  Positive Definite Matrices , 2007 .

[41]  S. Williams,et al.  Theory and applications of moment methods in many-Fermion systems , 1980 .

[42]  Gesine Reinert,et al.  Comparison of large networks with sub-sampling strategies , 2016, Scientific Reports.

[43]  Yongtang Shi,et al.  Graph distance measures based on topological indices revisited , 2015, Appl. Math. Comput..

[44]  Kazuyuki Aihara,et al.  Graph distance for complex networks , 2016, Scientific Reports.

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

[46]  Matthias Dehmer,et al.  A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees , 2015, Appl. Math. Comput..

[47]  Xuelong Li,et al.  A survey of graph edit distance , 2010, Pattern Analysis and Applications.