In combinatorics, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes.
- 1 Definitions
- 2 Relationships between different expansion properties
- 3 Constructions
- 4 Applications and useful properties
- 5 See also
- 6 Notes
- 7 References
- 8 External links
Intuitively, an expander is a finite, undirected multigraph in which every subset of the vertices that is not "too large" has a "large" boundary. Different formalisations of these notions give rise to different notions of expanders: edge expanders, vertex expanders, and spectral expanders, as defined below.
A disconnected graph is not an expander, since the boundary of a connected component is empty. Every connected graph is an expander; however, different connected graphs have different expansion parameters. The complete graph has the best expansion property, but it has largest possible degree. Informally, a graph is a good expander if it has low degree and high expansion parameters.
The edge expansion (also isoperimetric number or Cheeger constant) h(G) of a graph G on n vertices is defined as
In the equation, the minimum is over all nonempty sets S of at most n/2 vertices and ∂S is the edge boundary of S, i.e., the set of edges with exactly one endpoint in S.
The vertex isoperimetric number (also vertex expansion or magnification) of a graph G is defined as
where is the outer boundary of S, i.e., the set of vertices in with at least one neighbor in S. In a variant of this definition (called unique neighbor expansion) is replaced by the set of vertices in V with exactly one neighbor in S.
The vertex isoperimetric number of a graph G is defined as
where is the inner boundary of S, i.e., the set of vertices in S with at least one neighbor in .
When G is d-regular, a linear algebraic definition of expansion is possible based on the eigenvalues of the adjacency matrix A = A(G) of G, where is the number of edges between vertices i and j. Because A is symmetric, the spectral theorem implies that A has n real-valued eigenvalues . It is known that all these eigenvalues are in [−d, d].
Because G is regular, the uniform distribution with for all i = 1, ..., n is the stationary distribution of G. That is, we have Au = du, and u is an eigenvector of A with eigenvalue λ1 = d, where d is the degree of the vertices of G. The spectral gap of G is defined to be d−λ2, and it measures the spectral expansion of the graph G.
It is known that λn = −d if and only if G is bipartite. In many contexts, for example in the expander mixing lemma, a bound on λ2 is not enough, but indeed it is necessary to bound the absolute value of all the eigenvalues away from d:
Since this is the largest eigenvalue corresponding to an eigenvector orthogonal to u, it can be equivalently defined using the Rayleigh quotient:
is the 2-norm of the vector .
The normalized versions of these definitions are also widely used and more convenient in stating some results. Here one considers the matrix , which is the Markov transition matrix of the graph G. Its eigenvalues are between −1 and 1. For not necessarily regular graphs, the spectrum of a graph can be defined similarly using the eigenvalues of the Laplacian matrix. For directed graphs, one considers the singular values of the adjacency matrix A, which are equal to the roots of the eigenvalues of the symmetric matrix ATA.
Relationships between different expansion properties
The expansion parameters defined above are related to each other. In particular, for any d-regular graph G,
Consequently, for constant degree graphs, vertex and edge expansion are qualitatively the same.
Similar connections between vertex isoperimetric numbers and the spectral gap have also been studied:
Asymptotically speaking, the quantities , , and are all bounded above by the spectral gap .
There are three general strategies for constructing families of expander graphs. The first strategy is algebraic and group-theoretic, the second strategy is analytic and uses additive combinatorics, and the third strategy is combinatorial and uses the zig-zag and related graphs products. Noga Alon showed that certain graphs constructed from finite geometries are the sparsest examples of highly expanding graphs.
Algebraic constructions based on Cayley graphs are known for various variants of expander graphs. The following construction is due to Margulis and has been analysed by Gabber and Galil. For every natural number n, one considers the graph Gn with the vertex set , where : For every vertex , its eight adjacent vertices are
Then the following holds:
Theorem. For all n, the graph Gn has second-largest eigenvalue .
By a theorem of Alon and Boppana, all large enough d-regular graphs satisfy , where λ is the second largest eigenvalue in absolute value. Ramanujan graphs are d-regular graphs for which this bound is tight. That is, they satisfy . Hence Ramanujan graphs have an asymptotically smallest possible λ. They are also excellent spectral expanders.
Lubotzky, Phillips, and Sarnak (1988), Margulis (1988), and Morgenstern (1994) show how Ramanujan graphs can be constructed explicitly. By a theorem of Friedman (2003), random d-regular graphs on n vertices are almost Ramanujan, that is, they satisfy
with probability as n → ∞ tends to infinity.
Applications and useful properties
The original motivation for expanders is to build economical robust networks (phone or computer): an expander with bounded valence is precisely an asymptotic robust graph with number of edges growing linearly with size (number of vertices), for all subsets.
Expander graphs have found extensive applications in computer science, in designing algorithms, error correcting codes, extractors, pseudorandom generators, sorting networks (Ajtai, Komlós & Szemerédi (1983)) and robust computer networks. They have also been used in proofs of many important results in computational complexity theory, such as SL=L (Reingold (2008)) and the PCP theorem (Dinur (2007)). In cryptography, expander graphs are used to construct hash functions.
The following are some properties of expander graphs that have proven useful in many areas.
Expander mixing lemma
The expander mixing lemma states that, for any two subsets of the vertices S, T ⊆ V, the number of edges between S and T is approximately what you would expect in a random d-regular graph. The approximation is better the smaller is. In a random d-regular graph, as well as in an Erdős–Rényi random graph with edge probability d/n, we expect edges between S and T.
More formally, let E(S, T) 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,
Then the expander mixing lemma says that the following inequality holds:
where λ is the absolute value of the normalized second largest eigenvalue.
Expander walk sampling
The Chernoff bound states that, when sampling many independent samples from a random variables in the range [−1, 1], with high probability the average of our samples is close to the expectation of the random variable. The expander walk sampling lemma, due to Ajtai, Komlós & Szemerédi (1987) and Gillman (1998), states that this also holds true when sampling from a walk on an expander graph. This is particularly useful in the theory of derandomization, since sampling according to an expander walk uses many fewer random bits than sampling independently.
- Hoory, Linial & Widgerson (2006)
- Definition 2.1 in Hoory, Linial & Widgerson (2006)
- Bobkov, Houdré & Tetali (2000)
- Alon & Capalbo (2002)
- cf. Section 2.3 in Hoory, Linial & Widgerson (2006)
- This definition of the spectral gap is from Section 2.3 in Hoory, Linial & Widgerson (2006)
- Alon & Spencer 2011.
- Theorem 2.4 in Hoory, Linial & Widgerson (2006)
- See Theorem 1 and p.156, l.1 in Bobkov, Houdré & Tetali (2000). Note that λ2 there corresponds to 2(d − λ2) of the current article (see p.153, l.5)
- see, e.g., Yehudayoff (2012)
- "Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory". Combinatorica. 6: 207–219. doi:10.1007/BF02579382.
- see, e.g., p.9 of Goldreich (2011)
- Theorem 2.7 of Hoory, Linial & Widgerson (2006)
- Definition 5.11 of Hoory, Linial & Widgerson (2006)
- Theorem 5.12 of Hoory, Linial & Widgerson (2006)
- Theorem 7.10 of Hoory, Linial & Widgerson (2006)
Textbooks and surveys
- Alon, N.; Spencer, Joel H. (2011). "9.2. Eigenvalues and Expanders". The Probabilistic Method (3rd ed.). John Wiley & Sons.
- Chung, Fan R. K. (1997), Spectral Graph Theory, CBMS Regional Conference Series in Mathematics, 92, American Mathematical Society, ISBN 0-8218-0315-8
- Davidoff, Guiliana; Sarnak, Peter; Valette, Alain (2003), Elementary number theory, group theory and Ramanujan graphs, LMS student texts, 55, Cambridge University Press, ISBN 0-521-53143-8
- Hoory, Shlomo; Linial, Nathan; Widgerson, Avi (2006), "Expander graphs and their applications" (PDF), Bulletin (New series) of the American Mathematical Society, 43 (4): 439–561, doi:10.1090/S0273-0979-06-01126-8
- Krebs, Mike; Shaheen, Anthony (2011), Expander families and Cayley graphs: A beginner's guide, Oxford University Press, ISBN 0-19-976711-4
- Ajtai, M.; Komlós, J.; Szemerédi, E. (1983), "An O(n log n) sorting network", Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 1–9, doi:10.1145/800061.808726, ISBN 0-89791-099-0
- Ajtai, M.; Komlós, J.; Szemerédi, E. (1987), "Proceedings of the 19th Annual ACM Symposium on Theory of Computing", ACM, pp. 132–140, doi:10.1145/28395.28410, ISBN 0-89791-221-7
- Alon, N.; Capalbo, M. (2002). "Explicit unique-neighbor expanders". The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. p. 73. doi:10.1109/SFCS.2002.1181884. ISBN 0-7695-1822-2.
- Bobkov, S.; Houdré, C.; Tetali, P. (2000), "λ∞, vertex isoperimetry and concentration", Combinatorica, 20 (2): 153–172, doi:10.1007/s004930070018.
- Dinur, Irit (2007), "The PCP theorem by gap amplification", Journal of the ACM, 54 (3): 12–es, doi:10.1145/1236457.1236459.
- Gillman, D. (1998), "A Chernoff Bound for Random Walks on Expander Graphs", SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 27 (4,): 1203–1220, doi:10.1137/S0097539794268765
- Goldreich, Oded (2011), "Basic Facts about Expander Graphs", Studies in Complexity and Cryptography: 451–464, doi:10.1007/978-3-642-22670-0_30
- Reingold, Omer (2008), "Undirected connectivity in log-space", Journal of the ACM, 55 (4): Article 17, 24 pages, doi:10.1145/1391289.1391291
- Yehudayoff, Amir (2012), "Proving expansion in three steps", ACM SIGACT News, 43 (3): 67–84, doi:10.1145/2421096.2421115