Skip to Main content Skip to Navigation

# Finding a Bounded-Degree Expander Inside a Dense One

3 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also an expander. As with other consequences of the MSS theorem, it is not clear how one would explicitly construct such a subgraph. We show that such a subgraph (although with quantitatively weaker expansion and near-regularity properties than those predicted by MSS) can be constructed with high probability in linear time, via a simple algorithm. Our algorithm allows a distributed implementation that runs in $\mathcal O(\log n)$ rounds and does $\mathcal O(n)$ total work with high probability. The analysis of the algorithm is complicated by the complex dependencies that arise between edges and between choices made in different rounds. We sidestep these difficulties by following the combinatorial approach of counting the number of possible random choices of the algorithm which lead to failure. We do so by a compression argument showing that such random choices can be encoded with a non-trivial compression. Our algorithm bears some similarity to the way agents construct a communication graph in a peer-to-peer network, and, in the bipartite case, to the way agents select servers in blockchain protocols.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]

https://hal.archives-ouvertes.fr/hal-02002377
Contributor : Emanuele Natale <>
Submitted on : Friday, November 29, 2019 - 1:34:36 PM
Last modification on : Monday, October 12, 2020 - 10:30:40 AM

### File

Finding_a_Bounded_Degree_Expan...
Files produced by the author(s)

### Citation

Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan. Finding a Bounded-Degree Expander Inside a Dense One. SODA 2020 - ACM SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States. ⟨10.1137/1.9781611975994.80⟩. ⟨hal-02002377v2⟩

Record views

Files downloads