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:
“It was not till the middle of the second dance, when, from some pauses in the movement wherein they all seemed to look up, I fancied I could distinguish an elevation of spirit different from that which is the cause or the effect of simple jollity.—In a word, I thought I beheld Religion mixing in the dance.”
—Laurence Sterne (1713–1768)