English
Related papers

Related papers: Cheeger inequalities on simplicial complexes

200 papers

We introduce and develop equivalent spectral graph theory for several fundamental graph cut problems including maxcut, mincut, Cheeger cut, anti-Cheeger cut, dual Cheeger problem and their useful variants. A specified strategy for achieving…

Combinatorics · Mathematics 2026-01-21 Sihong Shao , Chuan Yang , Dong Zhang , Weixi Zhang

In this paper we extend the known results of analytic connectivity to non-uniform hypergraphs. We prove a modified Cheeger's inequality and also give a bound on analytic connectivity with respect to the degree sequence and diameter of a…

Discrete Mathematics · Computer Science 2017-01-18 Ashwin Guha , Muni Sreenivas Pydi , Biswajit Paria , Ambedkar Dukkipati

In this paper we consider the expansion properties and the spectrum of the combinatorial Laplace operator of a $d$-dimensional Linial-Meshulam random simplicial complex, above the cohomological connectivity threshold. We consider the…

Combinatorics · Mathematics 2020-06-18 Nikolaos Fountoulakis , Michał Przykucki

In this article, we derive bounds for values of the global geometry of locally tessellating planar graphs, namely, the Cheeger constant and exponential growth, in terms of combinatorial curvatures. We also discuss spectral implications for…

Spectral Theory · Mathematics 2008-05-13 Matthias Keller , Norbert Peyerimhoff

The Cheeger constant of a graph is the smallest possible ratio between the size of a subgraph and the size of its boundary. It is well known that this constant must be at least $\frac{\lambda_1}{2}$, where $\lambda_1$ is the smallest…

Combinatorics · Mathematics 2019-09-19 Jack Koolen , Greg Markowsky , Zhi Qiao

The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…

Numerical Analysis · Mathematics 2023-02-08 Lars Eldén

The data clustering problem consists in dividing a data set into prescribed groups of homogeneous data. This is a NP-hard problem that can be relaxed in the spectral graph theory, where the optimal cuts of a graph are related to the…

Analysis of PDEs · Mathematics 2024-10-08 Antonio Corbo Esposito , Gianpaolo Piscitelli

We introduce a concept of isoperimetric dimension for magnetic graphs, that is, graphs where every edge is assigned a complex number of modulus one. In analogy with the classical case, we show that isoperimetric inequalities imply Sobolev…

Combinatorics · Mathematics 2020-05-22 Javier Alejandro Chávez-Domínguez

In this paper we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the $n$th mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set…

Combinatorics · Mathematics 2015-02-03 Amir Daneshgar , Hossein Hajiabolhassan , Ramin Javadi

We conjecture that finite graphs with positive Cheeger constant admit a spanning subgraph with positive Cheeger constant and girth proportional to the diameter. We prove this conjecture for regular expander graphs with large expansion. Our…

Combinatorics · Mathematics 2021-12-04 Itai Benjamini , Mikolaj Fraczyk , Gabor Kun

Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…

Data Structures and Algorithms · Computer Science 2015-03-19 Anand Louis , Prasad Raghavendra , Prasad Tetali , Santosh Vempala

Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=... <= \lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2, \phi(G) =…

Data Structures and Algorithms · Computer Science 2013-01-24 Tsz Chiu Kwok , Lap Chi Lau , Yin Tat Lee , Shayan Oveis Gharan , Luca Trevisan

We introduce the notion of bipartiteness ratio for graphons. We prove the dual Cheeger-Buser inequality for graphons, which relates the gap between $2$ and the top of the spectrum of the Laplacian of a graphon with its bipartiteness ratio.…

Combinatorics · Mathematics 2025-02-24 Mugdha Mahesh Pokharanakar

In a recent breakthrough STOC~2015 paper, a continuous diffusion process was considered on hypergraphs (which has been refined in a recent JACM 2018 paper) to define a Laplacian operator, whose spectral properties satisfy the celebrated…

Discrete Mathematics · Computer Science 2018-05-01 T-H. Hubert Chan , Zhibin Liang

In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By…

Spectral Theory · Mathematics 2018-12-27 Bobo Hua , Lili Wang

Cheeger's inequality shows that any undirected graph $G$ with minimum nonzero normalized Laplacian eigenvalue $\lambda_G$ has a cut with conductance at most $O(\sqrt{\lambda_G})$. Qualitatively, Cheeger's inequality says that if the…

Discrete Mathematics · Computer Science 2018-11-28 Aaron Schild

The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…

Combinatorics · Mathematics 2016-07-27 Alexander Lubotzky , Zur Luria , Ron Rosenthal

We generalize the Cheeger inequality, a lower bound on the first nontrivial eigenvalue of a Laplacian, to the case of geometric sub-Laplacians on rank-varying Carnot-Carath\'eodory spaces and we describe a concrete method to lower bound the…

Spectral Theory · Mathematics 2025-02-18 Martijn Kluitenberg

We are interested in finding sharp bounds for the Cheeger constant $h$ via different geometrical quantities, namely the area $|\cdot|$, the perimeter $P$, the inradius $r$, the circumradius $R$, the minimal width $\omega$ and the diameter…

Analysis of PDEs · Mathematics 2024-03-01 Ilias Ftouhi , Alba Lia Masiello , Gloria Paoli

We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we…

Differential Geometry · Mathematics 2025-09-09 Bobo Hua , Supanat Kamtue , Shiping Liu , Florentin Münch , Norbert Peyerimhoff