Spectral Graph Complexity
Social and Information Networks
2022-11-04 v1
Abstract
We introduce a spectral notion of graph complexity derived from the Weyl's law. We experimentally demonstrate its correlation to how well the graph can be embedded in a low-dimensional Euclidean space.
Keywords
Cite
@article{arxiv.2211.01434,
title = {Spectral Graph Complexity},
author = {Anton Tsitsulin and Davide Mottin and Panagiotis Karras and Alex Bronstein and Emmanuel Müller},
journal= {arXiv preprint arXiv:2211.01434},
year = {2022}
}
Comments
BigNet workshop at the Web conferece'2019