Ellipsoidal embeddings of graphs
From MaRDI portal
Cites work
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Angular synchronization by eigenvectors and semidefinite programming
- Community detection in general stochastic block models: fundamental limits and efficient algorithms for recovery
- Complex networks: structure and dynamics
- Consistency of spectral clustering
- Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
- Exploring complex networks
- Extremal Graph Realizations and Graph Laplacian Eigenvalues
- Fast unfolding of communities in large networks
- Generalized power method for sparse principal component analysis
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Large networks and graph limits
- Machine Learning: ECML 2004
- Multiway spectral clustering: a margin-based perspective
- Nonconvex phase synchronization
- On semidefinite relaxations for the block model
- Phase transitions in semidefinite relaxations
- Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral Clustering on Spherical Coordinates Under the Degree-Corrected Stochastic Blockmodel
- Statistical inference on random dot product graphs: a survey
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
This page was built for publication: Ellipsoidal embeddings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013948)