Lifts, Discrepancy and Nearly Optimal Spectral Gap

Authors:
Yonatan Bilu;Nathan Linial
Affiliations:
Weizmann Institute of Science, Dept.of Molecular Genetics, 76100, Rehovot, Israel;Hebrew University, Institute of Computer Science, 91904, Jerusalem, Israel
Venue:
Combinatorica
Year:
2006

Citing 0
Cited 11

An elementary construction of constant-degree expanders

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An elementary construction of constant-degree expanders

Combinatorics, Probability and Computing
A combinatorial construction of almost-ramanujan graphs using the zig-zag product

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Max cut and the smallest eigenvalue

Proceedings of the forty-first annual ACM symposium on Theory of computing
A spectral approach to analysing belief propagation for 3-colouring

Combinatorics, Probability and Computing
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions

SIAM Journal on Computing
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product

SIAM Journal on Computing
Graph densification

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Random Lifts of $K_5\backslashe$ are 3-Colorable

SIAM Journal on Discrete Mathematics
Zero-one rounding of singular vectors

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Quasi-randomness and algorithmic regularity for graphs with general degree distributions

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a ...