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

Diala Wehbe () and Nicolas Wicker
Additional contact information
Diala Wehbe: University of Lille
Nicolas Wicker: University of Lille

Sankhya B: The Indian Journal of Statistics, 2022, vol. 84, issue 1, No 7, 188-203

Abstract: 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.

Keywords: Determinantal point process; Kernel; Laplacian Kernel; Metropolis-Hastings; Markov chain; Mixing time; Primary 05Cxx; Secondary 11Kxx (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13571-021-00258-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sankhb:v:84:y:2022:i:1:d:10.1007_s13571-021-00258-x

Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/13571

DOI: 10.1007/s13571-021-00258-x

Access Statistics for this article

Sankhya B: The Indian Journal of Statistics is currently edited by Dipak Dey

More articles in Sankhya B: The Indian Journal of Statistics from Springer, Indian Statistical Institute
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().