Expander Mixing Lemma

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. .

Read more about Expander Mixing Lemma:  Statement, Converse

Famous quotes containing the word mixing:

    How natural that the errors of the ancient should be handed down and, mixing with the principles and system which Christ taught, give to us an adulterated Christianity.
    Olympia Brown (1835–1900)