Alan Lew

Rigidity of expanders and pseudorandom graphs

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, the only continuous motions of the vertices preserving the distances between all pairs of adjacent vertices are those induced from the isometries of $\mathbb{R}^d$ (that is, translations and rotations of the whole graph...