English

Expanders with respect to Hadamard spaces and random graphs

Metric Geometry 2015-11-03 v2 Data Structures and Algorithms Combinatorics Functional Analysis

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.

Keywords

Cite

@article{arxiv.1306.5434,
  title  = {Expanders with respect to Hadamard spaces and random graphs},
  author = {Manor Mendel and Assaf Naor},
  journal= {arXiv preprint arXiv:1306.5434},
  year   = {2015}
}

Comments

incorporated Referees' comments

R2 v1 2026-06-22T00:38:48.880Z