| | |
Summary: The Expansion and Mixing Time of Skip Graphs
with Applications
James Aspnes
Department of Computer Science
Yale University
New Haven, CT 06520, USA
aspnes@cs.yale.edu
Udi Wieder
Department of Applied Math and Computer
Science
The Weizmann Institute of Science
Rehovot 76100 Israel
udi.wieder@weizmann.ac.il
ABSTRACT
We prove that with high probability a skip graph contains
a 4-regular expander as a subgraph, and estimate the qual-
ity of the expansion via simulations. As a consequence skip
graphs contain a large connected component even after an
adversarial deletion of nodes. We show how the expansion
|
