From expanders to better superconcentrators without cascading
Superconcentration is a strong property of interconnection diagraphs. We characterize its negation by existence of two disjoint and seperated sets which shrink under the forward and backward neighbor relation, respectively. This enables a better, non-cascaded design of superconcentrators, explicit ones with edge density ≤ 118, random ones with edge density ≤ 13.
Unable to display preview. Download preview PDF.
- L.A. Bassalygo, Asymptotically optimal swiching circuits. Problems of Information Transmission (1981), 206–211. [in Russian].Google Scholar
- O. Gabber and Z. Galil, Explicit construction of linear size superconcentrators. Proc. of IEEE 20th FOCS Conference 1971, 364–370.Google Scholar
- G.R. Grimmett and H. Kesten, First — passage perculation, network flows and electrical resistances 1982 (to appear).Google Scholar
- G. A. Margulis, Explicit construction of concentrators. Problems of Information Transmissiom 9 (1973), 71–80 [in Russian, English translation plenum 1975]Google Scholar
- E. Shamir and E. Upfal, 1 — factor in random graphs based on vertex choice. Discrete Math. 41 (1982), 281–286.Google Scholar
- E. Shamir and E. Upfal, On factors in random graphs. Israel J. of Math. 39 (1981), 296–301.Google Scholar