Construct · 1 fields · 1 citations

expander mixing lemma: 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.

Randomized algorithms

the result that in a regular graph with small second eigenvalue the number of edges between any two vertex sets is close to what a random graph would give.

In randomized algorithms, expander mixing lemma refers to the result that in a regular graph with small second eigenvalue the number of edges between any two vertex sets is close to what a random graph would give. This meaning comes from Alon (1988) in Discrete Mathematics.[1]

Unit
Recovery means
Measured by

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

See how expander mixing lemma 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

lemma1 fields · 3 citationsanchor · a standalone construct mixing3 fields · 5 citationsjingle · one word, three constructs number3 fields · 6 citationsjingle · one word, three constructs

References

Alon, N., & Chung, F. R. K. (1988). Explicit construction of linear sized tolerant networks. Discrete Mathematics, 72(1-3), 15-19. https://doi.org/10.1016/0012-365x(88)90189-6

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