Burnside processes on parking functions and Dyck paths mix in O(n log n) time, yielding approximate uniform sampling algorithms for increasing parking functions, Dyck paths, and polygon triangulations.
Rahmani, Mixing times for the commuting chain on CA groups
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Burnside process on parking functions and Dyck paths
Burnside processes on parking functions and Dyck paths mix in O(n log n) time, yielding approximate uniform sampling algorithms for increasing parking functions, Dyck paths, and polygon triangulations.