Robustness for expander graphs

Yaobin Chen, Yu Chen, Jie Han +1

We study robust versions of properties of $(n,d,\lambda )$-graphs, namely, the property of a random sparsification of an $(n,d,\lambda )$-graph, where each edge is retained with probability $p$…