Comparing large-scale graphs based on quantum probability theory

07/01/2018
by   Hayoung Choi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2022

Graph Comparison Based on Adjacency Function Matrix

In this paper, we present a new metric distance for comparing two large ...
research
12/27/2019

Approximate Graph Spectral Decomposition with the Variational Quantum Eigensolver

Spectral graph theory is a branch of mathematics that studies the relati...
research
04/29/2021

Constructions in combinatorics via neural networks

We demonstrate how by using a reinforcement learning algorithm, the deep...
research
02/22/2021

Spectral density of random graphs: convergence properties and application in model fitting

Random graph models are used to describe the complex structure of real-w...
research
07/09/2019

Open problems in the spectral theory of signed graphs

Signed graphs are graphs whose edges get a sign +1 or -1 (the signature)...
research
03/03/2020

Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphs

Graph comparison is a fundamental operation in data mining and informati...
research
10/16/2012

Spectral Estimation of Conditional Random Graph Models for Large-Scale Network Data

Generative models for graphs have been typically committed to strong pri...

Please sign up or login with your details

Forgot password? Click here to reset