Graph Comparison via the Non-backtracking Spectrum

@article{Mellor2019GraphCV,
  title={Graph Comparison via the Non-backtracking Spectrum},
  author={Andrew Mellor and Angelica Grusovin},
  journal={Physical review. E},
  year={2019},
  volume={99 5-1},
  pages={
          052309
        }
}
  • Andrew Mellor, Angelica Grusovin
  • Published 2019
  • Medicine, Physics, Computer Science
  • Physical review. E
  • The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance, however, often these are not metrics (rendering standard data-mining techniques infeasible) or are computationally infeasible for large graphs. In this work we define a new pseudometric based on the spectrum of the nonbacktracking graph operator and show that it cannot… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 46 REFERENCES

    Spectral Clustering of graphs with the Bethe Hessian

    VIEW 1 EXCERPT

    A study of graph spectra for comparing graphs and trees

    VIEW 1 EXCERPT

    A Family of Tractable Graph Distances

    VIEW 1 EXCERPT

    Spectral redemption in clustering sparse networks

    VIEW 1 EXCERPT