Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Fast and perfect sampling of subgraphs and polymer systems
Antonio Blanca, Sarah Cannon, Will Perkins
We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolati…
cs.DS2024
Perfect Sampling for Hard Spheres from Strong Spatial Mixing
Konrad Anand, Andreas Göbel, Marcus Pappik +1
We provide a perfect sampling algorithm for the hard-sphere model on subsets of with expected running time linear in the volume under the assumption of strong spatia…