Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms

DOI10.1145/2746539.2746555zbMath1321.05174arXiv1408.2425OpenAlexW2134062801MaRDI QIDQ2941566

Anand Louis

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

expansionspectral theoryheat dispersion

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Approximation algorithms (68W25)

Related Items (8)

Expansion in matrix-weighted graphs ⋮ Networks beyond pairwise interactions: structure and dynamics ⋮ Comparing the principal eigenvector of a hypergraph and its shadows ⋮ Nonlinear evolution equation associated with hypergraph Laplacian ⋮ Polynomial-time algorithms for submodular Laplacian systems ⋮ Unnamed Item ⋮ Generalizing the hypergraph Laplacian via a diffusion process with mediators ⋮ Diffusion operator and spectral analysis for directed hypergraph Laplacian

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms