Konrad Anand

works on

algorithmic complexity 1 approximation algorithms 1 linear time 1 product distributions 1 total variation distance 1

From the 1 of 5 linked papers with an AI index.

collaborators

Showing math.PRShow all

1 paper · 1 filter

math.PR2025

Rapid mixing of the flip chain over non-crossing spanning trees

Konrad Anand, Weiming Feng, Graham Freifeld +3

We show that the flip chain for non-crossing spanning trees of $n + 1$ points in convex position mixes in time $O (n^{8} lo g n)$ . We use connections between Fuss-Catalan structures to c…