Fast and Perfect Sampling of Subgraphs and Polymer Systems

Antonio Blanca, Sarah Cannon, Will Perkins

Research output: Contribution to journalArticlepeer-review


We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolation process with a carefully chosen rejection filter and works under a percolation subcriticality condition. We show that this condition is optimal in the sense that the task of (approximately) sampling weighted rooted graphlets becomes impossible in finite expected time for infinite graphs and intractable for finite graphs when the condition does not hold. We apply our sampling algorithm as a subroutine to give near linear-time perfect sampling algorithms for polymer models and weighted non-rooted graphlets in finite graphs, two widely studied yet very different problems. This new perfect sampling algorithm for polymer models gives improved sampling algorithms for spin systems at low temperatures on expander graphs and unbalanced bipartite graphs, among other applications.

Original languageEnglish (US)
Article number5
JournalACM Transactions on Algorithms
Issue number1
StatePublished - Jan 22 2024

All Science Journal Classification (ASJC) codes

  • Mathematics (miscellaneous)

Cite this