1. N. Alon. Perturbed identity matrices have high rank: proof and applications. Combinatorics, Probability and Computing, 18(1-2):3–15, 2009.
2. B. Barak, C.-N. Chou, Z. Lei, T. Schramm, and Y. Sheng. (nearly) efficient algorithms for the graph matching problem on correlated random graphs. In Advances in Neural Information Processing Systems (NIPS), volume 32. Curran Associates, Inc., 2019.
3. F. Barthe and E. Milman. Transference principles for log-Sobolev and spectral-gap with applications to conservative spin systems. Communications in Mathematical Physics, 323(2):575–625, 2013.
4. M. Bayati and A. Montanari. The dynamics of message passing on dense graphs, with applications to compressed sensing. IEEE Transactions on Information Theory, 57(2):764–785, 2011.
5. A. Berg, T. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pages 26–33, IEEE, 2005.