2 papers
cs.DS2025
Cycling in the forest with Wilson's algorithm
Michaël Fanuel, Rémi Bardenet
We consider a probability measure on cycle-rooted spanning forests (CRSFs) introduced by Kenyon. CRSFs are spanning subgraphs, each connected component of which has a unique cycle;…
quant-ph2025
Bypassing orthogonalization in the quantum DPP sampler
Michaël Fanuel, Rémi Bardenet
Given an matrix of rank , consider the problem of sampling integers with probability proportional to the squared determin…