Spectra, Euclidean representations and clusterings of hypergraphs

DOI10.1016/0012-365X(93)90322-KMaRDI QIDQ686145zbMATHFDO

Authors Marianna Bolla

Publication date 2 February 1994

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

clustereigenvaluesboundsEuclidean distanceshypergraph\(k\)-partition\(k\)-dimensional Euclidean representationscombinatorial measuresoptimal clusteringspectral of hypergraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

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

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3733094 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• scientific article; zbMATH DE number 3349875 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
• A new 5‐arc‐transitive cubic graph
• Bounds for eigenvalues of doubly stochastic matrices
• Eigenvalues and expanders
• Eigenvalues and partitionings of the edges of a graph
• Eigenvalues of a graph and its imbeddings
• On spectral characterization and embeddings of graphs
• Separation theorems for singular values of matrices and their applications in multivariate analysis
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• Some Recent Investigations of a New Fuzzy Partitioning Algorithm and its Application to Pattern Classification Problems
• The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding
• The characteristic polynomial of a graph
• Well-Separated Clusters and Optimal Fuzzy Partitions

Cited in

(21)

• Clustering in hypergraphs to minimize average edge service time
• Optimization problems for weighted graphs and related correlation estimates
• Testing community structure for hypergraphs
• Skill rating for multiplayer games. Introducing hypernode graphs and their spectral theory
• Limiting distribution of short cycles in inhomogeneous random uniform hypergraph
• Relaxation-based coarsening for multilevel hypergraph partitioning
• Clustering by hypergraphs and dimensionality of cluster systems
• A reductive approach to hypergraph clustering: an application to image segmentation
• Clustering theorems with twisted spectra
• GraphLSHC: towards large scale spectral hypergraph clustering
• Joint group and pairwise localities embedding for feature extraction
• Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
• Spectra and optimal partitions of weighted graphs
• Multidimensional clustering and hypergraphs
• Tensor complementarity problems. III: Applications
• The abstract Laplacian tensor of a hypergraph with applications in clustering
• Sharp detection boundaries on testing dense subhypergraph
• Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm
• Phase transitions in a power-law uniform hypergraph
• Scalable tensor methods for nonuniform hypergraphs
• Heterogeneous dense subhypergraph detection

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)