Finding a Bounded-Degree Expander Inside a Dense One

by   Luca Becchetti, et al.

It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G=(V,E) is a Δ-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 O( n) rounds and does (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.


page 1

page 2

page 3

page 4


On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time

We prove that for k+1≥ 3 and c>(k+1)/2 w.h.p. the random graph on n vert...

Finding induced subgraphs in scale-free inhomogeneous random graphs

We study the induced subgraph isomorphism problem on inhomogeneous rando...

Distributed Dense Subgraph Detection and Low Outdegree Orientation

The maximum density subgraph problem, introduced in the 80s by Picard an...

A color-avoiding approach to subgraph counting in bounded expansion classes

We present an algorithm to count the number of occurrences of a pattern ...

On Factors with Prescribed Degrees in Bipartite Graphs

We establish a new criterion for a bigraph to have a subgraph with presc...

Approximately counting independent sets in dense bipartite graphs via subspace enumeration

We give a randomized algorithm that approximates the number of independe...

Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion

Counting subgraph isomorphisms (also called motifs or graphlets) has bee...

Please sign up or login with your details

Forgot password? Click here to reset