Abstract

It is shown that there exists a sequence of 3-regular graphs {Gn}n=1∞\{G_n\}_{n=1}^\infty and a Hadamard space XX such that {Gn}n=1∞\{G_n\}_{n=1}^\infty forms an expander sequence with respect to XX, yet random regular graphs are not expanders with respect to XX. This answers a question of \cite{NS11}. {Gn}n=1∞\{G_n\}_{n=1}^\infty are also shown to be expanders with respect to random regular graphs, yielding a deterministic sublinear time constant factor approximation algorithm for computing the average squared distance in subsets of a random graph. The proof uses the Euclidean cone over a random graph, an auxiliary continuous geometric object that allows for the implementation of martingale methods.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.