1 citations · 4 across the 14 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
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…
cs.DS2019
Fast algorithms at low temperatures via Markov chains
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg +3
We define a discrete-time Markov chain for abstract polymer models and show that under sufficient decay of the polymer weights, this chain mixes rapidly. We apply this Markov chain…