How to Use
Select graph:
- Gap: λ₁-|λ₂|
- Ram.: Ramanujan?
- Mix: Speed
Ramanujan Graphs
d-regular graph is Ramanujan if |λ₂| ≤ 2√(d-1). Optimal spectral gap! Lubotzky-Phillips-Sarnak (1988): explicit constructions. Marcus-Spielman-Srivastava (2013): bipartite Ramanujan always exist.
Random Walk Mixing
Mixing time ∝ log(n)/(λ₁-|λ₂|). Larger gap → faster mixing. MCMC convergence. PageRank convergence. Decentralized computation speed. All controlled by spectral gap.
Step-by-Step Instructions
- 1Select graph.
- 2Find eigenvalues.
- 3Compute gap.
- 4Check Ramanujan.
- 5Estimate mixing.