Convergence Details About k -DPP Monte-Carlo Sampling for Large Graphs

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.