Construct · 1 fields · 1 citations

expander graph: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
expandergraph1 CONSTRUCTExpander graphHOORY · RANDOMIZED ALGORITHMS

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 sparse graph in which every not-too-large vertex set has many outgoing edges, used for derandomization, codes and robust networks.

In randomized algorithms, expander graph refers to a sparse graph in which every not-too-large vertex set has many outgoing edges, used for derandomization, codes and robust networks. This meaning comes from Hoory (2006) in Bulletin of the American Mathematical Society.[1]

Unit
Recovery means
Measured by

Next

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

See how expander 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. Hoory, S., Linial, N., & Wigderson, A. (2006). Expander graphs and their applications. Bulletin of the American Mathematical Society, 43(4), 439-561. https://doi.org/10.1090/s0273-0979-06-01126-8

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