Spectra and optimal partitions of weighted graphs
From MaRDI portal
Publication:1322166
DOI10.1016/0012-365X(94)90100-7zbMath0796.05066OpenAlexW2005820104MaRDI QIDQ1322166
Publication date: 15 September 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)90100-7
Related Items (10)
Regularity-based spectral clustering and mapping the Fiedler-carpet ⋮ SVD, discrepancy, and regular structure of contingency tables ⋮ Distribution of the eigenvalues of random block-matrices. ⋮ Beyond the expanders ⋮ Testing goodness of fit of random graph models ⋮ Noisy random graphs and their laplacians ⋮ Unnamed Item ⋮ Recognizing linear structure in noisy matrices ⋮ Modularity spectra, eigen-subspaces, and structure of weighted graphs ⋮ Optimization problems for weighted graphs and related correlation estimates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra, Euclidean representations and clusterings of hypergraphs
- Eigenvalues and expanders
- Separation theorems for singular values of matrices and their applications in multivariate analysis
- Well-Separated Clusters and Optimal Fuzzy Partitions
- Some Recent Investigations of a New Fuzzy Partitioning Algorithm and its Application to Pattern Classification Problems
- A new 5‐arc‐transitive cubic graph
This page was built for publication: Spectra and optimal partitions of weighted graphs