research-article

Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms

Author:

Anand LouisAuthors Info & Claims

STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing

Pages 713 - 722

https://doi.org/10.1145/2746539.2746555

Published: 14 June 2015 Publication History

Abstract

The celebrated Cheeger's Inequality [AM85,a86] establishes a bound on the expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the adjacency matrix (and other related matrices) of graphs. It has remained open to define a suitable spectral model for hypergraphs whose spectra can be used to estimate various combinatorial properties of the hypergraph. In this paper we introduce a new hypergraph Laplacian operator generalizing the Laplacian matrix of graphs. Our operator can be viewed as the gradient operator applied to a certain natural quadratic form for hypergraphs. We show that various hypergraph parameters (for e.g. expansion, diameter, etc) can be bounded using this operator's eigenvalues. We study the heat diffusion process associated with this Laplacian operator, and bound its parameters in terms of its spectra. All our results are generalizations of the corresponding results for graphs.

We show that there can be no linear operator for hypergraphs whose spectra captures hypergraph expansion in a Cheeger-like manner. Our Laplacian operator is non-linear, and thus computing its eigenvalues exactly is intractable. For any k, we give a polynomial time algorithm to compute an approximation to the kth smallest eigenvalue of the operator. We show that this approximation factor is optimal under the SSE hypothesis (introduced by [RS10]) for constant values of k.

Finally, using the factor preserving reduction from vertex expansion in graphs to hypergraph expansion, we show that all our results for hypergraphs extend to vertex expansion in graphs.

References

[1]

Sanjeev Arora, Boaz Barak, and David Steurer, Subexponential algorithms for unique games and related problems, Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, IEEE, 2010, pp. 563--572.

Digital Library

[2]

Noga Alon and Fan RK Chung, Explicit construction of linear sized tolerant networks, Annals of Discrete Mathematics 38 (1988), 15--19.

Digital Library

[3]

Sanjeev Arora, James Lee, and Assaf Naor, Euclidean distortion and the sparsest cut, Journal of the American Mathematical Society 21 (2008), no. 1, 1--21.

[4]

Noga Alon, Eigenvalues and expanders, Combinatorica 6 (1986), no. 2, 83--96.

Digital Library

[5]

Noga Alon and V. D. Milman, lambda_1, isoperimetric inequalities for graphs, and superconcentrators, J. Comb. Theory, Ser. B 38 (1985), no. 1, 73--88.

[6]

Sanjeev Arora, Satish Rao, and Umesh Vazirani, Expander flows, geometric embeddings and graph partitioning, Journal of the ACM (JACM) 56 (2009), no. 2, 5.

Digital Library

[7]

Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, and Roy Schwartz, Min-max graph partitioning and small set expansion, Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, IEEE, 2011, pp. 17--26.

Digital Library

[8]

Sergey Bobkov, Christian Houdré, and Prasad Tetali, lambda_infty vertex isoperimetry and concentration, Combinatorica 20 (2000), no. 2, 153--172.

[9]

Stephen T Barnard and Horst D Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience 6 (1994), no. 2, 101--117.

[10]

S Charles Brubaker and Santosh S Vempala, Random tensors and planted cliques, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Springer, 2009, pp. 406--419.

Digital Library

[11]

Umit V Catalyurek and Cevdet Aykanat, Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, Parallel and Distributed Systems, IEEE Transactions on 10 (1999), no. 7, 673--693.

Digital Library

[12]

Joshua Cooper and Aaron Dutle, Spectra of uniform hypergraphs, Linear Algebra and its Applicationstextbf436 (2012), no. 9, 3268--3292.

[13]

L Elisa Celis, Nikhil R Devanur, and Yuval Peres, Local dynamics in bargaining networks via random-turn games, Internet and Network Economics, Springer, 2010, pp. 133--144.

Digital Library

[14]

F Chung, The laplacian of a hypergraph, Expanding graphs (DIMACS series) (1993), 21--36.

[15]

Fan Chung, Spectral graph theory, American Mathematical Society, 1997.

[16]

Karen D Devine, Erik G Boman, Robert T Heaphy, Rob H Bisseling, and Umit V Catalyurek, Parallel hypergraph partitioning for scientific computing, Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International, IEEE, 2006, pp. 10--pp.

Digital Library

[17]

Irit Dinur, The pcp theorem by gap amplification, Journal of the ACM (JACM) 54 (2007), no. 3, 12.

Digital Library

[18]

Alina Ene and Huy L Nguyen, From graph to hypergraph multiway partition: Is the single threshold the only route?, Algorithms-ESA 2014, Springer Berlin Heidelberg, 2014, pp. 382--393.

[19]

Uriel Feige, Mohammad Taghi Hajiaghayi, and James R Lee, Improved approximation algorithms for minimum weight vertex separators, SIAM Journal on Computing 38 (2008), no. 2, 629--657.

Digital Library

[20]

Joel Friedman and Avi Wigderson, On the second eigenvalue of hypergraphs, Combinatorica 15 (1995), no. 1, 43--65.

[21]

Patrick Girard, L Guiller, C Landrault, and Serge Pravossoudovitch, Low power bist design by hypergraph partitioning: methodology and architectures, Test Conference, 2000. Proceedings. International, IEEE, 2000, pp. 652--661.

Digital Library

[22]

Bruce Hendrickson and Robert Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM Journal on Scientific Computing 16 (1995), no. 2, 452--469.

Digital Library

[23]

Christopher J Hillar and Lek-Heng Lim, Most tensor problems are np-hard, Journal of the ACM (JACM) 60 (2013), no. 6, 45.

Digital Library

[24]

Shlomo Hoory, Nathan Linial, and Avi Wigderson, Expander graphs and their applications, Bulletin of the American Mathematical Society 43 (2006), no. 4, 439--561.

[25]

Shenglong Hu and Liqun Qi, The laplacian of a uniform hypergraph, Journal of Combinatorial Optimization (2013), 1--36.

Digital Library

[26]

Shenglong Hu and Liqun Qi, The eigenvectors associated with the zero eigenvalues of the laplacian and signless laplacian tensors of a uniform hypergraph, Discrete Applied Mathematicstextbf169 (2014), 140--151.

Digital Library

[27]

George Karypis, Rajat Aggarwal, Vipin Kumar, and Shashi Shekhar, Multilevel hypergraph partitioning: applications in vlsi domain, Very Large Scale Integration (VLSI) Systems, IEEE Transactions on 7 (1999), no. 1, 69--79.

Digital Library

[28]

Tali Kaufman, David Kazhdan, and Alexander Lubotzky, Ramanujan complexes and bounded degree topological expanders, Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on, IEEE, 2014, pp. 484--493.

Digital Library

[29]

John Lenz and Dhruv Mubayi, Eigenvalues and quasirandom hypergraphs, arXiv preprint arXiv:1208.4863 (2012).

[30]

John Lenz and Dhruv Mubayi, Eigenvalues of non-regular linear quasirandom hypergraphs, arXiv preprint arXiv:1309.3584 (2013).

[31]

Anand Louis and Konstantin Makarychev, Approximation algorithm for sparsest k-partitioning., SODA, SIAM, 2014, pp. 1244--1255.

Digital Library

[32]

Anand Louis and Yury Makarychev, Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014), vol. 28, 2014, pp. 339--355.

[33]

John Lenz and Dhruv Mubayi, Eigenvalues and linear quasirandom hypergraphs, Forum of Mathematics, Sigma, vol. 3, Cambridge Univ Press, 2015, p. e2.

[34]

James R Lee, Shayan Oveis Gharan, and Luca Trevisan, Multi-way spectral partitioning and higher-order cheeger inequalities, Proceedings of the 44th symposium on Theory of Computing, ACM, 2012, pp. 1117--1130.

Digital Library

[35]

Anand Louis, Hypergraph markov operators, eigenvalues and approximation algorithms, arXiv preprint arXiv:1408.2425 (2014).

[36]

Anand Louis, Prasad Raghavendra, Prasad Tetali, and Santosh Vempala, Algorithmic extensions of cheeger's inequality to higher eigenvalues and partitions, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Springer, 2011, pp. 315--326.

Digital Library

[37]

Anand Louis, Prasad Raghavendra, Prasad Tetali, and Santosh Vempala, Many sparse cuts via higher eigenvalues, Proceedings of the 44th symposium on Theory of Computing, ACM, 2012, pp. 1131--1140.

Digital Library

[38]

Anand Louis, Prasad Raghavendra, and Santosh Vempala, The complexity of approximating vertex expansion, Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on, IEEE, 2013, pp. 360--369.

Digital Library

[39]

Ravi R Montenegro and Prasad Tetali, Mathematical aspects of mixing times in markov chains, Now Publishers Inc, 2006.

Digital Library

[40]

Ori Parzanchevski, Mixing in high-dimensional expanders, arXiv preprint arXiv:1310.6477 (2013).

[41]

Ori Parzanchevski and Ron Rosenthal, Simplicial complexes: spectrum, homology and random walks, arXiv preprint arXiv:1211.6775 (2012).

[42]

Ori Parzanchevski, Ron Rosenthal, and Ran J Tessler, Isoperimetric inequalities in simplicial complexes, arXiv preprint arXiv:1207.0638 (2012).

[43]

Yuval Peres, Oded Schramm, Scott Sheffield, and David Wilson, Tug-of-war and the infinity laplacian, Journal of the American Mathematical Society 22 (2009), no. 1, 167--210.

[44]

J.A. Rodriguez, Laplacian eigenvalues and partition problems in hypergraphs, Applied Mathematics Letterstextbf22 (2009), no. 6, 916 -- 921.

[45]

Prasad Raghavendra and David Steurer, Graph expansion and the unique games conjecture, Proceedings of the 42nd ACM symposium on Theory of computing, ACM, 2010, pp. 755--764.

Digital Library

[46]

Prasad Raghavendra, David Steurer, and Prasad Tetali, Approximations for the isoperimetric and spectral profile of graphs and related parameters, Proceedings of the 42nd ACM symposium on Theory of computing, ACM, 2010, pp. 631--640.

Digital Library

[47]

Alistair Sinclair and Mark Jerrum, Approximate counting, uniform generation and rapidly mixing markov chains, Information and Computation 82 (1989), no. 1, 93--133.

Digital Library

[48]

John Steenbergen, Caroline Klivans, and Sayan Mukherjee, A cheeger-type inequality on simplicial complexes, Advances in Applied Mathematics 56 (2014), 56--77.

[49]

Michael Sipser and Daniel A. Spielman, Expander codes, IEEE Transactions on Information Theorytextbf42 (1996), 1710--1722.

Cited By

Akamatsu T(2024)WEAK KANTOROVICH DIFFERENCE AND ASSOCIATED RICCI CURVATURE OF HYPERGRAPHSTsukuba Journal of Mathematics10.21099/tkbjm/2024480113148:1Online publication date: 1-Jul-2024
https://doi.org/10.21099/tkbjm/20244801131
Oliver PZhang EZhang Y(2024)Scalable Hypergraph VisualizationIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.332659930:1(595-605)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TVCG.2023.3326599
Lau LTung KWang RSaha BServedio R(2023)Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted EigenvaluesProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585139(1834-1847)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585139
Show More Cited By

Index Terms

Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms

Recommendations

Spectral Properties of Hypergraph Laplacian and Approximation Algorithms

The celebrated Cheeger’s Inequality (Alon and Milman 1985; Alon 1986) establishes a bound on the edge expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and ...
Intersection graphs of maximal hypercubes

In this paper we consider cube graphs, that is intersection graphs of maximal hypercubes of graphs. In contrast to the related concepts of line graphs and clique graphs, we show that any graph is a cube graph of a (bipartite) graph. We answer a question ...
Crossing graphs of fiber-complemented graphs

Fiber-complemented graphs form a vast non-bipartite generalization of median graphs. Using a certain natural coloring of edges, induced by parallelism relation between prefibers of a fiber-complemented graph, we introduce the crossing graph of a fiber-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing

June 2015

916 pages

ISBN:9781450335362

DOI:10.1145/2746539

General Chair:
Rocco Servedio
Columbia University
,
Program Chair:
Ronitt Rubinfeld
MIT and Tel Aviv University

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 June 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

STOC '15

Sponsor:

SIGACT

STOC '15: Symposium on Theory of Computing

June 14 - 17, 2015

Oregon, Portland, USA

Acceptance Rates

STOC '15 Paper Acceptance Rate 93 of 347 submissions, 27%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
571
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)5

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Akamatsu T(2024)WEAK KANTOROVICH DIFFERENCE AND ASSOCIATED RICCI CURVATURE OF HYPERGRAPHSTsukuba Journal of Mathematics10.21099/tkbjm/2024480113148:1Online publication date: 1-Jul-2024
https://doi.org/10.21099/tkbjm/20244801131
Oliver PZhang EZhang Y(2024)Scalable Hypergraph VisualizationIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.332659930:1(595-605)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TVCG.2023.3326599
Lau LTung KWang RSaha BServedio R(2023)Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted EigenvaluesProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585139(1834-1847)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585139
Veldt N(2023)Cut-matching Games for Generalized Hypergraph Ratio CutsProceedings of the ACM Web Conference 202310.1145/3543507.3583539(694-704)Online publication date: 30-Apr-2023
https://dl.acm.org/doi/10.1145/3543507.3583539
Clark GThomaz FStephen A(2023)Comparing the Principal Eigenvector of a Hypergraph and its ShadowsLinear Algebra and its Applications10.1016/j.laa.2023.05.006Online publication date: May-2023
https://doi.org/10.1016/j.laa.2023.05.006
Li LWang YGuo XYuan LLi BXu S(2023)Short-Text Conceptualization Based on Hyper-Graph Learning and Multiple Prior KnowledgeSocial Media Processing10.1007/978-981-99-7596-9_8(104-117)Online publication date: 15-Nov-2023
https://doi.org/10.1007/978-981-99-7596-9_8
Wenping ZMeilin LJiye L(2022)Hypergraphs: Concepts, Applications and Analysis2022 IEEE 13th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)10.1109/PAAP56126.2022.10010428(1-6)Online publication date: 25-Nov-2022
https://doi.org/10.1109/PAAP56126.2022.10010428
Kwok TLau LTung K(2022)Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00042(366-377)Online publication date: Oct-2022
https://doi.org/10.1109/FOCS54457.2022.00042
Kapralov MKrauthgamer RTardos JYoshida Y(2022)Spectral Hypergraph Sparsifiers of Nearly Linear Size2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS52979.2021.00114(1159-1170)Online publication date: Feb-2022
https://doi.org/10.1109/FOCS52979.2021.00114
Tudisco FBenson AProkopchik K(2021)Nonlinear Higher-Order Label SpreadingProceedings of the Web Conference 202110.1145/3442381.3450035(2402-2413)Online publication date: 19-Apr-2021
https://dl.acm.org/doi/10.1145/3442381.3450035
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents