Related papers: Buser's inequality on infinite graphs

We study functional inequalities for Markov chains on discrete spaces with entropic Ricci curvature bounded from below. Our main results are that when curvature is non-negative, but not necessarily positive, the spectral gap, the Cheeger…

In this paper, we present a Lichnerowicz type estimate and (higher order) Buser type estimates for the magnetic Laplacian on a closed Riemannian manifold with a magnetic potential. These results relate eigenvalues, magnetic fields, Ricci…

In this paper, we study the Dirichlet-to-Neumann operators on infinite subgraphs of graphs. For an infinite graph, we prove Cheeger-type estimates for the bottom spectrum of the Dirichlet-to-Neumann operator, and the higher order Cheeger…

We prove a lower bound for the $k$-th Steklov eigenvalues in terms of an isoperimetric constant called the $k$-th Cheeger-Steklov constant in three different situations: finite spaces, measurable spaces, and Riemannian manifolds. These…

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…

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…

A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…

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…

We consider a dual Cheeger constant $\overline h$ for finite graphs with edge weights from an arbitrary real-closed ordered field. We obtain estimates of $\overline h$ in terms of number of vertices in graph. Further, we estimate the…

We prove that a Bishop-Gromov inequality gives a lower bound of coarse Ricci curvature. We also have an estimate of the eigenvalues of the Laplacian by a lower bound of coarse Ricci curvature.

In this short note, we provide a quantitative global Poincar\'e inequality for one forms on a closed Riemannian four manifold, in terms of an upper bound on the diameter, a positive lower bound on the volume, and a two-sided bound on Ricci…

For discrete weighted graphs there is sufficient literature about the Cheeger cut and the Cheeger problem, but for metric graphs there are few results about these problems. Our aim is to study the Cheeger cut and the Cheeger problem in…

Using an inverse system of metric graphs as in: J. Cheeger and B. Kleiner, "Inverse limit spaces satisfying a Poincar\'e inequality", we provide a simple example of a metric space $X$ that admits Poincar\'e inequalities for a continuum of…

In this paper we prove a new extremal property of the Reuleaux triangle: it maximizes the Cheeger constant among all bodies of (same) constant width. The proof relies on a fine analysis of the optimality conditions satisfied by an optimal…

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…

Liu, M\"unch, and Peyerimhoff introduced the notion of Bakry-\'Emery curvature for connection graphs as a means to derive Buser-type bounds on the eigenvalues of connection Laplacians. In this work, we present a reformulation of the…

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

As a non-trivial extension of the celebrated Cheeger inequality, the higher-order Cheeger inequalities for graphs due to Lee, Oveis Gharan and Trevisan provide for each $k$ an upper bound for the $k$-way Cheeger constant in forms of…

Let M be a bounded domain of a Euclidian space with smooth boundary. We relate the Cheeger constant of M and the conductance of a neighborhood graph defined on a random sample from M. By restricting the minimization defining the latter over…

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…