Fast eigenvalue finders for data with graph symmetries
From MaRDI portal
Cites work
- Complete equitable decompositions
- Equitable decompositions of graphs with symmetries
- Exploring symmetries to decompose matrices and graphs preserving the spectrum
- Extensions and applications of equitable decompositions for graphs with symmetries
- Fast linear algebra is stable
- Fourier decompositions of graphs with symmetries and equitable partitions
- General equitable decompositions for graphs with symmetries
- Graph partitions and cluster synchronization in networks of oscillators
- scientific article; zbMATH DE number 3983386 (Why is no real title available?)
- scientific article; zbMATH DE number 1131873 (Why is no real title available?)
- scientific article; zbMATH DE number 1890110 (Why is no real title available?)
- LAPACK Users' Guide
- Minimal specialization: coevolution of network structure and dynamics
- Spectra of graphs
- Spectral analysis of random-to-random Markov chains
- Spectral Methods for Data Science: A Statistical Perspective
- Spectral properties of complex networks
- Symmetry in complex networks
- The complexity of the matrix eigenproblem
This page was built for publication: Fast eigenvalue finders for data with graph symmetries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293012)