Cheeger constant (graph theory)

{{Short description|Measure of whether or not a graph has a "bottleneck"}}

{{about|the Cheeger constant in graph theory|a different use in Riemannian geometry|Cheeger constant}}

[[File:Cheeger constant.svg|thumb|180px|Here, a subset {{mvar|A}} of the graph {{mvar|G}} (denoted red) has 3 vertices, and 3 edges leaving its subset (denoted green and dashed). The number of edges leaving the subset divided by the size of the subset is denoted $| \partial A |/| A |$ , which here is $3/3 = 1$ .

The Cheeger constant is the minimum $| \partial A |/| A |$ of all subsets of the graph {{mvar|G}} which are not empty and whose size is less than or equal to half the size of {{mvar|G}}. For this graph {{mvar|G}}, this subset {{mvar|A}} has the smallest value $| \partial A |/| A |$ , and therefore 1 is the Cheeger constant of {{mvar|G}}]]

In mathematics, the Cheeger constant (also Cheeger number or isoperimetric number) of a graph is a numerical measure of whether or not a graph has a "bottleneck". The Cheeger constant as a measure of "bottleneckedness" is of great interest in many areas: for example, constructing well-connected networks of computers, card shuffling. The graph theoretical notion originated after the Cheeger isoperimetric constant of a compact Riemannian manifold.

The Cheeger constant is named after the mathematician Jeff Cheeger.

Definition

Let {{mvar|G}} be an undirected finite graph with vertex set {{math|V(G)}} and edge set {{math|E(G)}}. For a collection of vertices {{math|A ⊆ V(G)}}, let {{math|∂A}} denote the collection of all edges going from a vertex in {{mvar|A}} to a vertex outside of {{mvar|A}} (sometimes called the edge boundary of {{mvar|A}}):

: $\partial A := \{ \{x, y\} \in E(G) \ : \ x \in A, y \in V(G) \setminus A \}.$

Note that the edges are unordered, i.e., $\{x, y\} = \{y, x\}$ . The Cheeger constant of {{mvar|G}}, denoted {{math|h(G)}}, is defined by{{sfn | Mohar | 1989 | pp=274–291}}

: $h(G) := \min \left\{\frac$

\partial A

\ : \ A \subseteq V(G), 0 < | A | \leq \tfrac{1}{2} | V(G)| \right\}.

The Cheeger constant is strictly positive if and only if {{mvar|G}} is a connected graph. Intuitively, if the Cheeger constant is small but positive, then there exists a "bottleneck", in the sense that there are two "large" sets of vertices with "few" links (edges) between them. The Cheeger constant is "large" if any possible division of the vertex set into two subsets has "many" links between those two subsets.

Example: computer networking

Image:RingNetwork.svg

In applications to theoretical computer science, one wishes to devise network configurations for which the Cheeger constant is high (at least, bounded away from zero) even when {{math|{{!}}V(G){{!}}}} (the number of computers in the network) is large.

For example, consider a ring network of {{math|N ≥ 3}} computers, thought of as a graph {{mvar|G_N}}. Number the computers {{math|1, 2, ..., N}} clockwise around the ring. Mathematically, the vertex set and the edge set are given by:

: $\begin{align}
V(G_{N}) &= \{ 1, 2, \cdots, N-1, N \} \\
E(G_{N}) &= \big\{ \{1, 2\}, \{2, 3\}, \cdots, \{N - 1, N\}, \{N, 1\} \big\}
\end{align}$

Take {{mvar|A}} to be a collection of $\left \lfloor \tfrac{N}{2} \right \rfloor$ of these computers in a connected chain:

: $A = \left \{ 1, 2, \cdots, \left \lfloor \tfrac{N}{2} \right \rfloor \right \}.$

So,

: $\partial A = \left \{ \left \{ \left \lfloor \tfrac{N}{2} \right \rfloor, \left \lfloor \tfrac{N}{2} \right \rfloor + 1 \right \}, \{N, 1\} \right \},$

and

: $\frac$

\partial A

= \frac{2}{\left \lfloor \tfrac{N}{2} \right \rfloor} \to 0 \mbox{ as } N \to \infty.

This example provides an upper bound for the Cheeger constant {{math|h(G_N)}}, which also tends to zero as {{math|N → ∞}}. Consequently, we would regard a ring network as highly "bottlenecked" for large {{mvar|N}}, and this is highly undesirable in practical terms. We would only need one of the computers on the ring to fail, and network performance would be greatly reduced. If two non-adjacent computers were to fail, the network would split into two disconnected components.

Cheeger Inequalities

The Cheeger constant is especially important in the context of expander graphs as it is a way to measure the edge expansion of a graph. The so-called Cheeger inequalities relate the eigenvalue gap of a graph with its Cheeger constant. More explicitly

: $2h(G) \geq \lambda \geq \frac{h^2(G)}{2 \Delta(G)}$

in which $\Delta(G)$ is the maximum degree for the nodes in $G$ and $\lambda$ is the spectral gap of the Laplacian matrix of the graph.{{sfn | Montenegro | Tetali | 2006 | pp=237–354}} The Cheeger inequality is a fundamental result and motivation for spectral graph theory.

Notes

References

{{cite journal | last=Mohar | first=Bojan | authorlink=Bojan Mohar | title=Isoperimetric numbers of graphs | journal=Journal of Combinatorial Theory, Series B | volume=47 | issue=3 | date=1989 | doi=10.1016/0095-8956(89)90029-4 | pages=274–291| doi-access=free }}
{{cite journal | last=Montenegro | first=Ravi | last2=Tetali | first2=Prasad | title=Mathematical Aspects of Mixing Times in Markov Chains | journal=Foundations and Trends in Theoretical Computer Science | volume=1 | issue=3 | date=2006 | issn=1551-305X | doi=10.1561/0400000003 | pages=237–354}}
{{cite journal | last=Donetti | first=Luca | last2=Neri | first2=Franco | last3=Muñoz | first3=Miguel A | title=Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that | journal=Journal of Statistical Mechanics: Theory and Experiment | volume=2006 | issue=08 | date=2006-08-07 | issn=1742-5468 | doi=10.1088/1742-5468/2006/08/P08007 | pages=P08007–P08007 | bibcode=2006JSMTE..08..007D | arxiv=cond-mat/0605565 | s2cid=16192273}}
{{cite journal | last=Lackenby | first=Marc | title=Heegaard splittings, the virtually Haken conjecture and Property (τ) | journal=Inventiones mathematicae | volume=164 | issue=2 | date=2006 | issn=0020-9910 | doi=10.1007/s00222-005-0480-x | pages=317–359 | bibcode=2006InMat.164..317L | arxiv=math/0205327 | s2cid = 12847770}}

Category:Computer network analysis

Category:Graph invariants