1. Anari, N., Gharan, S.O. and Rezaei, A. (2016). Monte Carlo Markov chain algorithms for sampling strongly Rayleigh distributions and determinantal point processes. In: COLT.
2. Borcea, J., Branden, P. and Liggett, T.M. (2009). Negative dependence and the geometry of polynomials. J. Am. Math. Soc. 22, 521–567.
3. Cvetković, D., Rowlinson, P. and Simić, S. (2010). An Introduction to the Theory of Graph Spectra. Cambridge University Press.
4. Cheeger, J. (1970). A lower bound for the smallest eigenvalue of the Laplacian. Problems in Analysis, (R. C. Gunning, ed.) Princeton University Press, pp. 195–199.
5. Chib, S. and Greenberg, E. (1995). Understanding the Metropolis-Hastings algorithm. Am. Stat. 49, 327–335.