activity
20232026
most citedComparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics

1 citations · 2 across the 6 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

math.PR2025

On Algorithmic Robustness of Corrupted Markov Chains

Jason Gaitonde, Elchanan Mossel

We study the algorithmic robustness of general finite Markov chains in terms of their stationary distributions to general, adversarial corruptions of the transition matrix. We show…