Isoperimetric Inequalities and Decay of Iterated Kernels for almost-transitive Markov Chains. - Laurent Saloff-Coste (Comb. Probab. Comput., 1995)

Computing Norms of group-Invariant Transition Operators. - Laurent Saloff-Coste; Wolfgang Woess (Comb. Probab. Comput., 1996)

What Do We Know about the Metropolis Algorithm? - Persi Diaconis; Laurent Saloff-Coste (J. Comput. Syst. Sci., 1998)

The cutoff phenomenon for randomized riffle shuffles. - Guan-Yu Chen; Laurent Saloff-Coste (Random Struct. Algorithms, 2008)

Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups. - Guan-Yu Chen; Laurent Saloff-Coste (J. Appl. Probab., 2013)

The hit-and-run version of top-to-random. - Samuel Boardman; Daniel Rudolf; Laurent Saloff-Coste (J. Appl. Probab., 2022)