Spectral Graph Complexity

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.

arXiv commentBigNet workshop at the Web conferece'2019

References in corpus (8)

• DeepWalk: Online Learning of Social Representations
• Synchronization in complex networks
• Consistency of spectral clustering
• VERSE: Versatile Graph Embeddings from Similarity Measures
• NetLSD: Hearing the Shape of a Graph
• Synchronization in Network Geometries with Finite Spectral Dimension
• Complex Quantum Network Manifolds in Dimension $d>2$ are Scale-Free
• Matrix Energy as a Measure of Topological Complexity of a Graph

Cited by in corpus (1)

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