Generalizing the hypergraph Laplacian via a diffusion process with mediators

DOI10.1007/978-3-319-94776-1_37zbMath1442.05144arXiv1804.11128OpenAlexW2999782657WikidataQ127489779 ScholiaQ127489779MaRDI QIDQ5916256

No author found.

Publication date: 4 October 2018

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.11128

zbMATH Keywords

diffusion processLaplacian operatordiffusion modelCheeger's inequalityhypergraph Laplacian

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Networks beyond pairwise interactions: structure and dynamics ⋮ 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 ⋮ Unnamed Item

Cites Work

• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Eigenvalues and expanders
• Diffusion operator and spectral analysis for directed hypergraph Laplacian
• Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
• Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions
• Expander graphs and their applications
• On clusterings
• Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
• Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile
• Approximation Algorithm for Sparsest k-Partitioning
• Multi-way spectral partitioning and higher-order cheeger inequalities
• Many sparse cuts via higher eigenvalues
• Improved Cheeger's inequality

This page was built for publication: Generalizing the hypergraph Laplacian via a diffusion process with mediators