Everything About ___
Live briefing

Everything about Expander walk sampling

In the mathematical discipline of graph theory, the expander walk sampling theorem intuitively states that sampling vertices in an expander graph by doing relatively short random walk can simulate sampling the vertices independently from a uniform distribution. The earliest version of this theorem is due to Ajtai, Komlós & Szemerédi (1987), and the more general version is typically attributed to Gillman (1998). Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Expander walk samplingA 5-minute orientation
  2. Pick up a classic book: American FilmThe most-reprinted book on the subject
  3. Go sideways: Gegenbauer polynomialsA closely related topic
  4. Go sideways: Johnson–Lindenstrauss lemmaA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Statement
  2. Proof
  3. Uses

🏆 Landmark papers (most cited)

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics