Construct · 1 fields · 1 citations

Ramanujan graph: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
Ramanujangraph1 CONSTRUCTRamanujan graphLUBOTZKY · RANDOMIZED

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

Randomized algorithms

a regular graph whose nontrivial eigenvalues meet the best possible spectral bound, making it an optimal expander.

In randomized algorithms, Ramanujan graph refers to a regular graph whose nontrivial eigenvalues meet the best possible spectral bound, making it an optimal expander. This meaning comes from Lubotzky (1988) in Combinatorica.[1]

Unit
Recovery means
Measured by

Next

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

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

Open in ColliderExport BibTeXReport this entry

References

  1. Lubotzky, A., Phillips, R., & Sarnak, P. (1988). Ramanujan graphs. Combinatorica, 8(3), 261-277. https://doi.org/10.1007/bf02126799

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