Spectra, Euclidean representations and clusterings of hypergraphs
From MaRDI portal
Publication:686145
DOI10.1016/0012-365X(93)90322-KzbMATH Open0781.05036MaRDI QIDQ686145FDOQ686145
Publication date: 2 February 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Investigating the connectivity of hypergraphs via their spectra
- Spectra of uniform hypergraphs
- The abstract Laplacian tensor of a hypergraph with applications in clustering
- Spectra and optimal partitions of weighted graphs
- A reductive approach to hypergraph clustering: an application to image segmentation
clustereigenvaluesboundsEuclidean distanceshypergraph\(k\)-partition\(k\)-dimensional Euclidean representationscombinatorial measuresoptimal clusteringspectral of hypergraphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Eigenvalues and expanders
- Title not available (Why is that?)
- Well-Separated Clusters and Optimal Fuzzy Partitions
- Title not available (Why is that?)
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- Title not available (Why is that?)
- On spectral characterization and embeddings of graphs
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new 5‐arc‐transitive cubic graph
- Separation theorems for singular values of matrices and their applications in multivariate analysis
- The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding
- The characteristic polynomial of a graph
- Eigenvalues of a graph and its imbeddings
- Bounds for eigenvalues of doubly stochastic matrices
- Eigenvalues and partitionings of the edges of a graph
- Title not available (Why is that?)
- Some Recent Investigations of a New Fuzzy Partitioning Algorithm and its Application to Pattern Classification Problems
Cited In (16)
- Tensor complementarity problems. III: Applications
- Title not available (Why is that?)
- Optimization problems for weighted graphs and related correlation estimates
- Testing community structure for hypergraphs
- Scalable tensor methods for nonuniform hypergraphs
- Spectra and optimal partitions of weighted graphs
- Limiting distribution of short cycles in inhomogeneous random uniform hypergraph
- Joint group and pairwise localities embedding for feature extraction
- Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm
- The abstract Laplacian tensor of a hypergraph with applications in clustering
- Sharp detection boundaries on testing dense subhypergraph
- Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
- Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
- Heterogeneous dense subhypergraph detection
- Phase transitions in a power-law uniform hypergraph
- Clustering theorems with twisted spectra
This page was built for publication: Spectra, Euclidean representations and clusterings of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686145)