Abstract
This paper aims at making explicit the mixing time found by Anari et al. (2016) for k-DPP Monte-Carlo sampling when it is applied on large graphs. This yields a polynomial bound on the mixing time of the associated Markov chain under mild conditions on the eigenvalues of the Laplacian matrix when the number of edges grows.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
Borcea, J., Branden, P. and Liggett, T.M. (2009). Negative dependence and the geometry of polynomials. J. Am. Math. Soc. 22, 521–567.
Cvetković, D., Rowlinson, P. and Simić, S. (2010). An Introduction to the Theory of Graph Spectra. Cambridge University Press.
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.
Chib, S. and Greenberg, E. (1995). Understanding the Metropolis-Hastings algorithm. Am. Stat. 49, 327–335.
Chung, F.R.K. (1997). Spectral Graph Theory CBMS Regional Conference Series in Mathematics, 92. American Mathematical Society, Providence.
Deshpande, A. and Rademacher, L. (2010). Efficient volume sampling for row/column subset selection. FOCS Number 1-3-4 329–338.
Greenhill, C. (2013). Making Markov chains less lazy arXiv:1203.6668.
Gobel, F. and Jagers, A. (1974). Random walks on graphs. Stoch. Process. Appl. 2, 311–336.
Horn, R.A. and Johnson, C.R. (1985). Matrix analysis. Cambridge University Press.
Kannan, R. and Vempala, S. (2009). Spectral algorithms. Found. Trends Theor. Comput. Sci. 4, 157–288.
Kang, B. (2013). Fast determinantal point process sampling with application to clustering. NIPS, pp. 2319–2327.
Kulesza, A. and Taskar, B. (2012). Determinantal point processes for machine learning. Found. Trends Mach. Learn. 5, 123–286.
Kulesza, A. and Taskar, B. (2011). kDPPs: fixed size determinantal point processes. In: Proceedings of the 28th International Conference on Machine Learning. pp 1193–1200.
Levin, A.D., Peres, Y. and Wilmer, E.L. (2006). Markov chains and mixing times american. Mathematical Society.
Li, H.H., Li, J.S. and Fan, Y.-Z. (2008). The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges, Vol. 56.
Li, H.H. and Li, J.S. (2011). A note on the normalized Laplacian spectra, Vol. 15.
Li, J., Guo, J.-M., Shiu, W.C. and Chang, A. (2014). An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications, Vol. 171.
Lovász, L. (1993). Random walks on graphs: A survey. Combinatorics, Paul erdös is Eighty 2, 1–46.
Macchi, O. (1975). The Coincidence approach to stochastic point processes. Adv. Appl. Probab. 7, 83–122.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wehbe, D., Wicker, N. Convergence Details About k-DPP Monte-Carlo Sampling for Large Graphs. Sankhya B 84, 188–203 (2022). https://doi.org/10.1007/s13571-021-00258-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13571-021-00258-x