English

User Manual Privacy Policy Disclaimer Contact us

# Item

ITEM ACTIONSEXPORT
Finding a Bounded-Degree Expander Inside a Dense One

Becchetti, L., Clementi, A., Natale, E., Pasquale, F., & Trevisan, L. (2018). Finding a Bounded-Degree Expander Inside a Dense One. Retrieved from http://arxiv.org/abs/1811.10316.

Item is

### Basic

show hide
Item Permalink: Version Permalink:
Genre: Paper

### Files

show Files
hide Files
:
arXiv:1811.10316.pdf (Preprint), 478KB
File Permalink:
Name:
arXiv:1811.10316.pdf
Description:
File downloaded from arXiv at 2019-01-07 09:43
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

show

### Creators

show
hide
Creators:
Becchetti, Luca1, Author
Clementi, Andrea1, Author
Natale, Emanuele2, Author
Pasquale, Francesco1, Author
Trevisan, Luca1, Author
Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

### Content

show
hide
Free keywords: Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
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 $\bigO(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.

### Details

show
hide
Language(s): eng - English
Dates: 2018-11-262018
Publication Status: Published online
Pages: 21 p.
Publishing info: -
Table of Contents: -
Rev. Type: -
Identifiers: arXiv: 1811.10316
URI: http://arxiv.org/abs/1811.10316
BibTex Citekey: Becchetti_arXiv1811.10316
Degree: -

show

show

show

show