[M73] Grigorii Aleksandrovich Margulis. 1973. Explicit constructions of concentrators. Problemy Peredachi Informatsii 9, 4 (1973), 71–80.
[GG81] Ofer Gabber and Zvi Galil. 1981. Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences 22, 3 (June 1981), 407–420. DOI:https://doi.org/10.1016/0022-0000(81)90040-4
[T14] Luca Trevisan. 2014. Lecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory. https://people.eecs.berkeley.edu/~luca/books/expanders.pdf
[KMP18] Anson Kahng, Simon Mackenzie, and Ariel D Procaccia. 2018. Liquid Democracy: An Algorithmic Perspective. (2018). Retrieved from http://procaccia.info/papers/liquid.pdf
[GKMP18] Paul Gölz, Anson Kahng, Simon Mackenzie, and Ariel D Procaccia. 2018. The Fluid Mechanics of Liquid Democracy. (2018).
[NR02] Moni Naor and Omer Reingold. 2002. Constructing Pseudo-Random Permutations with a Prescribed Structure. Journal of Cryptology 15, 2 (January 2002), 97–102. DOI:https://doi.org/10.1007/s00145-001-0008-5
[KKMO07] Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell. 2007. Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? SIAM Journal on Computing 37, 1 (January 2007), 319–357. DOI:https://doi.org/10.1137/S0097539705447372
[BBCV11] Paolo Boldi, Francesco Bonchi, Carlos Castillo, and Sebastiano Vigna. 2011. Viscous democracy for social networks. Communications of the ACM 54, 6 (June 2011), 129. DOI:https://doi.org/10.1145/1953122.1953154
[KMP18] Anson Kahng, Simon Mackenzie, and Ariel D Procaccia. 2018. Liquid Democracy: An Algorithmic Perspective. (2018). Retrieved from http://procaccia.info/papers/liquid.pdf
[GW16] Anna Gundert and Uli Wagner. 2016. On eigenvalues of random complexes. Israel Journal of Mathematics 216, 2 (October 2016), 545–582. DOI:https://doi.org/10.1007/s11856-016-1419-1