no code implementations • 16 Jul 2020 • Richard Combes, Mikael Touati
We further propose the SWCP (Self-Winning Cycles Propagation) algorithm and show that, when the degree is large enough, SWCP solves the game with high probability.
no code implementations • 15 Jun 2018 • Richard Combes, Mikael Touati
We consider the problem of estimating from sample paths the absolute spectral gap $\gamma_*$ of a reversible, irreducible and aperiodic Markov chain $(X_t)_{t \in \mathbb{N}}$ over a finite state space $\Omega$.
