The joint mixing time of the random walk and dynamical random-cluster process is Θ(log n) when edge updates are fast enough in the subcritical regime on random regular graphs.
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities
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
-
Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
The joint mixing time of the random walk and dynamical random-cluster process is Θ(log n) when edge updates are fast enough in the subcritical regime on random regular graphs.