1. Dimensionality reduction: beyond the Johnson-Lindenstrauss bound;Bartal, Yair;Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms,2011
2. Fastest mixing Markov chain on graphs with symmetries;Boyd, Stephen;SIAM J. Optim.,2009
3. Fastest mixing Markov chain on a graph;Boyd, Stephen;SIAM Rev.,2004
4. [4] Charikar, Moses; Waingarten, Erik The Johnson–Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction (2022) (https://arxiv.org/abs/2205.00371)
5. [5] Deza, Michel Marie; Laurent, Monique Geometry of cuts and metrics, Algorithms and Combinatorics, 15, Springer, 1997