Related papers: Cheeger inequalities on simplicial complexes

Cheeger inequality is a classical result emerging from the isoperimetric problem in the field of geometry. In the graph theory, a discrete version of Cheeger inequality was also studied deeply and the notion was further extended for higher…

In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…

For graphs there exists a strong connection between spectral and combinatorial expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the lower bound of which states that $\lambda(G) \leq h(G)$, where…

The Cheeger inequalities give an upper and lower bound on the spectral gap of discrete Laplacians defined on a graph in terms of the geometric characteristics of the graph. We generalise this approach and we employ it to determine if a…

The Cheeger inequality for undirected graphs, which relates the conductance of an undirected graph and the second smallest eigenvalue of its normalized Laplacian, is a cornerstone of spectral graph theory. The Cheeger inequality has been…

We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…

We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more…

In this paper, we consider a variation on Cheeger numbers related to the coboundary expanders recently defined by Dotterer and Kahle. A Cheeger-type inequality is proved, which is similar to a result on graphs due to Fan Chung. This…

The celebrated Cheeger's Inequality 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 eigenvectors of the adjacency…

The graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose edges have the same cardinality. In particular, it is shown that the second largest eigenvalue of the generalized normalized Laplacian is…

We define a new Cheeger-like constant for graphs and we use it for proving Cheeger-like inequalities that bound the largest eigenvalue of the normalized Laplace operator.

Many fundamental structures of Riemannian geometry have found discrete counterparts for graphs or combinatorial ones for simplicial complexes. These include those discussed in this survey, Hodge theory, Morse theory, the spectral theory of…

We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…

The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…

In this paper, some new forms of the Cheeger's inequalities are established for general (maybe unbounded) symmetric forms, the resulting estimates improve and extend the ones obtained by Lawler and Sokal (1988) for bounded jump processes.…

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if…

Our goal in this paper is to find an estimate for the spectral gap of the Laplacian on a 2-simplicial complex consisting on a triangulation of a complete graph. An upper estimate is given by generalizing the Cheeger constant. The lower…

The O(d) Synchronization problem consists of estimating a set of unknown orthogonal transformations O_i from noisy measurements of a subset of the pairwise ratios O_iO_j^{-1}. We formulate and prove a Cheeger-type inequality that relates a…

The celebrated Cheeger's Inequality \cite{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…

The discrete Cheeger inequality, due to Alon and Milman (J. Comb. Theory Series B 1985), is an indispensable tool for converting the combinatorial condition of graph expansion to an algebraic condition on the eigenvalues of the graph…