A graph complexity measure based on the spectral analysis of the Laplace operator
DOI10.1016/j.chaos.2022.111817zbMath1506.05124arXiv2109.06706OpenAlexW3200249410MaRDI QIDQ2677044
Hugo Aimar, Diego M. Mateos, Federico Morana
Publication date: 12 January 2023
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.06706
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Medical applications (general) (92C50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Mean phase coherence as a measure for phase synchronization and its application to the EEG of epilepsy patients
- Spectral distances on graphs
- Complex networks: structure and dynamics
- Emergence of Scaling in Random Networks
- Collective dynamics of ‘small-world’ networks
- Random Graphs
- Encyclopedia of Distances
- Unnamed Item
This page was built for publication: A graph complexity measure based on the spectral analysis of the Laplace operator