Construct · 1 fields · 1 citations

Cheeger inequality: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

the two-sided link between a graph's second eigenvalue and how hard the graph is to cut, the basis for spectral partitioning and expansion arguments.

In graph theory, Cheeger inequality refers to the two-sided link between a graph's second eigenvalue and how hard the graph is to cut, the basis for spectral partitioning and expansion arguments. This meaning comes from Alon (1985) in Journal of Combinatorial Theory, Series B.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Cheeger inequality sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

basis3 fields · 5 citationsjingle · one word, three constructs expansion4 fields · 4 citationsjingle · one word, four expansions link3 fields · 5 citationsjingle · one word, three constructs

References

Alon, N., & Milman, V. D. (1985). λ1, Isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B, 38(1), 73-88. https://doi.org/10.1016/0095-8956(85)90092-9

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct