A new algorithm samples balanced tree-weighted bipartitions directly on planar graphs in expected O(n) time, bypassing spanning tree sampling and speeding up redistricting analysis.
Log-concave polynomials IV: Approximate exchange, tight mixing times, and near-optimal 23 sampling of forests
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sampling Tree-Weighted Partitions Without Sampling Trees
A new algorithm samples balanced tree-weighted bipartitions directly on planar graphs in expected O(n) time, bypassing spanning tree sampling and speeding up redistricting analysis.