Spectra, Euclidean representations and clusterings of hypergraphs

DOI10.1016/0012-365X(93)90322-KzbMath0781.05036MaRDI QIDQ686145

Marianna Bolla

Publication date: 2 February 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

clusterhypergrapheigenvaluesboundsEuclidean distances\(k\)-partition\(k\)-dimensional Euclidean representationscombinatorial measuresoptimal clusteringspectral of hypergraphs

Mathematics Subject Classification ID

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

Related Items (11)

Testing community structure for hypergraphs ⋮ Unnamed Item ⋮ 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 ⋮ Joint group and pairwise localities embedding for feature extraction ⋮ Limiting distribution of short cycles in inhomogeneous random uniform hypergraph ⋮ Tensor complementarity problems. III: Applications ⋮ Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning ⋮ Optimization problems for weighted graphs and related correlation estimates ⋮ Spectra and optimal partitions of weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On spectral characterization and embeddings of graphs
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• Eigenvalues and expanders
• Separation theorems for singular values of matrices and their applications in multivariate analysis
• Eigenvalues of a graph and its imbeddings
• The characteristic polynomial of a graph
• Eigenvalues and partitionings of the edges of a graph
• Bounds for eigenvalues of doubly stochastic matrices
• Well-Separated Clusters and Optimal Fuzzy Partitions
• 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
• A new 5‐arc‐transitive cubic graph
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

This page was built for publication: Spectra, Euclidean representations and clusterings of hypergraphs