Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
From MaRDI portal
Publication:4561502
DOI10.1145/3178123zbMath1426.05163arXiv1605.01483OpenAlexW2963055664WikidataQ130155181 ScholiaQ130155181MaRDI QIDQ4561502
Anand Louis, Chenzi Zhang, Zhihao Gavin Tang, T.-H. Hubert Chan
Publication date: 6 December 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.01483
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (15)
Networks beyond pairwise interactions: structure and dynamics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding Cheeger cuts in hypergraphs via heat equation ⋮ Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm ⋮ What Are Higher-Order Networks? ⋮ The structure and dynamics of networks with higher order interactions ⋮ Comparing the principal eigenvector of a hypergraph and its shadows ⋮ Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian ⋮ Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery ⋮ Generalizing the hypergraph Laplacian via a diffusion process with mediators ⋮ Pseudoinverse graph convolutional networks. Fast filters tailored for large eigengaps of dense graphs and hypergraphs ⋮ A Cheeger cut for uniform hypergraphs ⋮ Diffusion operator and spectral analysis for directed hypergraph Laplacian ⋮ Nonlocal pagerank
This page was built for publication: Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
