Two metric spaces are said to be quasi isometric if their metrics are equivalent up to multiplicative and additive constants. This notion, introduced by Gromov (1981) for
We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on deep results from combinatorial group theory. It applies both to regular and irregular random graphs.