2002 · 222 citations · 31 references
Natural SciencesComputer ScienceMathematicsCondensed Matter PhysicsProbability TheoryStochastic ProcessesEntropyGraph TheoryEigenvalue BoundsEigenvalue ComputationExpander GraphsExpansionExpansion In GraphsRandom Graph TheoryRandomness ExpansionRandomness Extractors
The main concrete result of this paper is the first explicit construction of constant degree lossless expanders. In these graphs, the expansion factor is almost as large as possible: (1—ε)D, where D is the degree and ε is an arbitrarily small constant. The best previous explicit constructions gave expansion factor D/2, which is too weak for many applications. The D/2 bound was obtained via the eigenvalue method, and is known that that method cannot give better bounds.The main abstract contribution of this paper is the introduction and initial study of randomness conductors, a notion which generalizes extractors, expanders, condensers and other similar objects. In all these functions, certain guarantee on the input "entropy" is converted to a guarantee on the output "entropy". For historical reasons, specific objects used specific guarantees of different flavors. We show that the flexibility afforded by the conductor definition leads to interesting combinations of these objects, and to better constructions such as those above.The main technical tool in these constructions is a natural generalization to conductors of the zig-zag graph product, previously defined for expanders and extractors.
31
COMBINATORICA · 1986 · 1.2K citations
Alexander Lubotzky, Ralph S. Phillips, Peter Sarnak · COMBINATORICA · 1988 · 1K citations
M. Sipser, Daniel A. Spielman · IEEE Transactions on Information Theory · 1996 · 942 citations
Noam Nisan, David Zuckerman · Journal of Computer and System Sciences · 1996 · 652 citations