55 citations · 134 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
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.DS2019
Counting independent sets in unbalanced bipartite graphs
Sarah Cannon, Will Perkins
We give an FPTAS for approximating the partition function of the hard-core model for bipartite graphs when there is sufficient imbalance in the degrees or fugacities between the si…