Uniform hypergraph partitioning: provable tensor methods and sampling techniques
From MaRDI portal
Signed and weighted graphs (05C22) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10)
Recommendations
- Consistency of spectral hypergraph partitioning under planted partition model
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- k-way hypergraph partitioning via n-level recursive bisection
- Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
Cited in
(12)- Exact recovery in the hypergraph stochastic block model: a spectral algorithm
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
- Nonparametric modeling of higher-order interactions via hypergraphons
- Consistency of spectral hypergraph partitioning under planted partition model
- Multilayer hypergraph clustering using the aggregate similarity matrix
- Community Detection in General Hypergraph Via Graph Embedding
- Generalizing p-Laplacian: spectral hypergraph theory and a partitioning algorithm
- A family of pairwise multi-marginal optimal transports that define a generalized metric
- Sparse random hypergraphs: non-backtracking spectra and community detection
- Partial recovery and weak consistency in the non-uniform hypergraph stochastic block model
- Modeling Hypergraphs with Diversity and Heterogeneous Popularity
This page was built for publication: Uniform hypergraph partitioning: provable tensor methods and sampling techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361317)
