Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs

DOI10.1007/s13571-021-00258-xzbMath1487.05169OpenAlexW3153798775MaRDI QIDQ2135593

Diala Wehbe, Nicolas Wicker

Publication date: 9 May 2022

Published in: Sankhyā. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13571-021-00258-x

zbMATH Keywords

Markov chainkernelmixing timedeterminantal point processmetropolis-HastingsLaplacian kernel

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the normalized Laplacian spectra
• Random walks on graphs
• An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
• Determinantal Point Processes for Machine Learning
• Negative dependence and the geometry of polynomials
• The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
• Spectral Algorithms
• Matrix Analysis
• The coincidence approach to stochastic point processes

This page was built for publication: Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs