Proves Õ(n²) bound on relaxation and log-Sobolev times for the triangulation flip chain on convex polygons, improving the prior Õ(n³) upper bound.
Probability Theory and Related Fields , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster Mixing for Triangulations via Transport Flows
Proves Õ(n²) bound on relaxation and log-Sobolev times for the triangulation flip chain on convex polygons, improving the prior Õ(n³) upper bound.