Eigenvalues of Random Signed Graphs with Cycles: A Graph-Centered View of the Method of Moments with Practical Applications
Metadata only
Author
Date
2022Type
- Conference Paper
ETH Bibliography
yes
Altmetrics
Abstract
We illustrate a simple connection between the cycles in a graph and eigenvalues its the adjacency matrix. Then we use this connection to derive properties of the eigenvalues of random graphs with short cyclic motifs and circulant graphs with random signs. We find that the eigenvalue distributions that emerge from those structures are surprisingly beautiful. Finally, we illustrate their practical relevance in the field Reservoir Computing. Show more
Publication status
publishedExternal links
Editor
Book title
Complex Networks & Their Applications XJournal / series
Studies in Computational IntelligenceVolume
Pages / Article No.
Publisher
SpringerEvent
Subject
Random matrix theory; Cycles; Motifs; Circulant graphs; Reservoir computingOrganisational unit
09479 - Grewe, Benjamin F. / Grewe, Benjamin F.
More
Show all metadata
ETH Bibliography
yes
Altmetrics