English
Related papers

Related papers: The Normalized Graph Cut and Cheeger Constant: fro…

200 papers

In this article, we study relations between the local geometry of planar graphs (combinatorial curvature) and em global geometric invariants, namely the Cheeger constants and the exponential growth. We also discuss spectral applications.

Metric Geometry · Mathematics 2009-07-30 Matthias Keller , Norbert Peyerimhoff

We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…

Combinatorics · Mathematics 2015-10-26 Bo'az Klartag , Gady Kozma , Peter Ralli , Prasad Tetali

The $\mu$-conductance measure proposed by Lov\'asz and Simonovits is a size-specific conductance score that identifies the set with smallest conductance while disregarding those sets with volume smaller than a $\mu$ fraction of the whole…

Discrete Mathematics · Computer Science 2026-02-02 Yufan Huang , David F. Gleich

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

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…

Data Structures and Algorithms · Computer Science 2018-10-15 Yuichi Yoshida

In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…

Group Theory · Mathematics 2025-11-04 Costantino Delizia , Michele Gaeta , Carmine Monetta

The tau constant is an important invariant of a metrized graph, and it has applications in arithmetic properties of curves. We show how the tau constant of a metrized graph changes under successive edge contractions and deletions. We…

Combinatorics · Mathematics 2009-05-20 Zubeyir Cinkir

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…

Spectral Theory · Mathematics 2012-09-25 Frank Bauer , Matthias Keller , Radosław K. Wojciechowski

We develop the notion of higher Cheeger constants for a measurable set $\Omega \subset \mathbb{R}^N$. By the $k$-th Cheeger constant we mean the value \[h_k(\Omega) = \inf \max \{h_1(E_1), \dots, h_1(E_k)\},\] where the infimum is taken…

Analysis of PDEs · Mathematics 2018-11-13 Vladimir Bobkov , Enea Parini

We show how 'test' vector fields may be used to give lower bounds for the Cheeger constant of a Euclidean domain (or Riemannian manifold with boundary), and hence for the lowest eigenvalue of the Dirichlet Laplacian on the domain. Also, we…

Differential Geometry · Mathematics 2007-05-23 Daniel Grieser

This note details how a recent structure theorem for normal $1$-currents proved by the first and third author allows to prove a conjecture of Cheeger concerning the structure of Lipschitz differentiability spaces. More precisely, we show…

Metric Geometry · Mathematics 2016-08-08 Guido De Philippis , Andrea Marchese , Filip Rindler

The regular $N$-gon provides the minimal Cheeger constant in the class of all $N$-gons with fixed volume. This result is due to a work of Bucur and Fragal\`a in 2014. In this note, we address the stability of their result in terms of the…

Analysis of PDEs · Mathematics 2014-12-03 Marco Caroccia , Robin Neumayer

We review the theory of Cheeger constants for graphs and quantum graphs and their present and envisaged applications.

Combinatorics · Mathematics 2018-07-26 James B. Kennedy , Delio Mugnolo

We relate the nontrivial singular values $\sigma_2,\ldots,\sigma_n$ of the normalized adjacency matrix of an Eulerian directed graph to combinatorial measures of graph expansion: \\ 1. We introduce a new directed analogue of conductance…

Combinatorics · Mathematics 2025-08-26 Jake Ruotolo , Salil Vadhan

We prove a general result characterizing a specific class of Serrin domains as supports of unbounded and periodic constant mean curvature graphs. We apply this result to prove the existence of a family of unbounded periodic constant mean…

Analysis of PDEs · Mathematics 2021-01-11 Ignace Aristide Minlend

Let $G$ be a finite group and $S$ be a symmetric generating set of $G$ with $|S| = d$. We show that if the undirected Cayley sum graph $C_{\Sigma}(G,S)$ is an expander graph and is non-bipartite, then the spectrum of its normalised…

Combinatorics · Mathematics 2019-07-23 Arindam Biswas , Jyoti Prakash Saha

We construct two minimal Cheeger sets in the Euclidean plane, i.e. unique minimizers of the ratio "perimeter over area" among their own measurable subsets. The first one gives a counterexample to the so-called weak regularity property of…

Analysis of PDEs · Mathematics 2018-08-30 Gian Paolo Leonardi , Giorgio Saracco

In this paper we introduce a Cheeger-type constant defined as a minimization of a suitable functional among all the $N$-clusters contained in an open bounded set $\Omega$. Here with $N$-Cluster we mean a family of $N$ sets of finite…

Analysis of PDEs · Mathematics 2017-03-31 Marco Caroccia

Given a group $\Gamma$, we establish a connection between the unitarisability of its uniformly bounded representations and the asymptotic behaviour of the isoperimetric constants of Cayley graphs of $\Gamma$ for increasingly large…

Functional Analysis · Mathematics 2018-02-19 Maria Gerasimova , Dominik Gruber , Nicolas Monod , Andreas Thom

Given an undirected graph $G$, the classical Cheeger constant, $h_G$, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The well-known Cheeger's inequality…

Combinatorics · Mathematics 2015-03-02 Franklin Kenter , Mary Radcliffe