An Explicit Construction of an Expander Family
نویسنده
چکیده
This paper proves that there exist infinite families of graphs which satisfy a uniform lower bound on their spectral gap. We first prove existence via a probabilistic method. The explicit construction involves various results from algebra and representation theory, which we explore at some length. It turns out that the expander family we construct achieves a maximal condition on expander families, though with our methods we cannot prove this fact.
منابع مشابه
Explicit expanders with cutoff phenomena
The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph. The first example of a family of bounded-degree graphs where the random walk exhibits cutoff in total-variation was provided only very recently, when the aut...
متن کاملAn Explicit Construction of Quantum Expanders
Quantum expanders are a natural generalization of classical expanders. These objects were introduced and studied by [1, 3, 4]. In this note we show how to construct explicit, constant-degree quantum expanders. The construction is essentially the classical Zig-Zag expander construction of [5], applied to quantum expanders.
متن کاملSymmetric Groups and Expanders
We construct an explicit generating sets Fn and F̃n of the alternating and the symmetric groups, which make the Cayley graphs C(Alt(n), Fn) and C(Sym(n), F̃n) a family of bounded degree expanders for all sufficiently large n. These expanders have many applications in the theory of random walks on groups and other areas of mathematics. A finite graph Γ is called an ǫ-expander for some ǫ ∈ (0, 1), ...
متن کاملEfficient Compressed Sensing using Lossless Expander Graphs with Fast Bilateral Quantum Recovery Algorithm
Compressed Sensing is a novel approach to bypass the Nyquist sampling limits whenever the signals are sparse, and to compress them simultaneously. In this paper, improving our previous results, we will propose a compressed sensing algorithm based on the high-quality lossless unbalanced vertex expander graphs, with a fast and simple quantum decoding algorithm. Exploiting the unique neighborhood ...
متن کاملOn codes from hypergraphs
We propose a new family of asymptotically good binary codes, generalizing previous constructions of expander codes to -uniform hypergraphs. We also describe an efficient decoding algorithm for these codes, that for a certain region of rates improves the known results for decoding distance of expander codes. The construction is based on hypergraphs with a certain “expansion” property called here...
متن کامل