Comparing large-scale graphs based on quantum probability theory
From MaRDI portal
Publication:2279341
DOI10.1016/j.amc.2019.03.061zbMath1428.05186arXiv1807.00252OpenAlexW2962973811WikidataQ128008276 ScholiaQ128008276MaRDI QIDQ2279341
Yuanming Shi, Hayoung Choi, Yifei Shen, Ho Soo Lee
Publication date: 12 December 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.00252
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (2)
Cospectrality of multipartite graphs ⋮ Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations
Cites Work
- Unnamed Item
- Inequalities for the number of walks in graphs
- Distance between spectra of graphs
- Spectral distances of graphs
- Graph distance measures based on topological indices revisited
- A survey of graph edit distance
- A similarity measure for graphs with low computational complexity
- Cospectral graphs and the generalized adjacency matrix
- A study of graph spectra for comparing graphs and trees
- Number of walks and degree powers in a graph
- Measures of distance between probability distributions
- Enumeration of cospectral graphs.
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
- Global similarity tests of physical designs of circuits: a complex network approach
- Isospectral graphs and isoperimetric constants
- A new dissimilarity measure for comparing labeled graphs
- Fifty years of graph matching, network alignment and network comparison
- Distance between the normalized Laplacian spectra of two graphs
- Spectral distances on graphs
- Comparing large graphs efficiently by margins of feature vectors
- A DNA-based graph encoding scheme with its applications to graph isomorphism problems
- Bounds on the number of closed walks in a graph and its applications
- Spectral Analysis of Growing Graphs
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Distance between distance spectra of graphs
- A determinant characterization of moment sequences with finitely many mass points
- On Information and Sufficiency
This page was built for publication: Comparing large-scale graphs based on quantum probability theory
