Statement
Let be a d-regular graph with normalized second-largest eigenvalue (in absolute value) of the adjacency matrix. Then for any two subsets, let denote the number of edges between S and T. If the two sets are not disjoint, edges in their intersection are counted twice, that is, . We have
For a proof, see references.
Read more about this topic: Expander Mixing Lemma
Famous quotes containing the word statement:
“After the first powerful plain manifesto
The black statement of pistons, without more fuss
But gliding like a queen, she leaves the station.”
—Stephen Spender (1909–1995)
“He has the common feeling of his profession. He enjoys a statement twice as much if it appears in fine print, and anything that turns up in a footnote ... takes on the character of divine revelation.”
—Margaret Halsey (b. 1910)
“The most distinct and beautiful statement of any truth must take at last the mathematical form.”
—Henry David Thoreau (1817–1862)