The expander mixing lemma states that, for any two subsets of a d-regular expander graph, the number of edges between and is approximately what you would expect in a random d-regular graph, i.e. .
Famous quotes containing the word mixing:
“Political image is like mixing cement. When it’s wet, you can move it around and shape it, but at some point it hardens and there’s almost nothing you can do to reshape it.”
—Walter F. Mondale (b. 1928)