Laurent Saloff-Coste

According to our database, Laurent Saloff-Coste authored at least 6 papers between 1995 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

The hit-and-run version of top-to-random.

Samuel Boardman, Daniel Rudolf, Laurent Saloff-Coste

J. Appl. Probab., 2022

2013

Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups.

Guan-Yu Chen, Laurent Saloff-Coste

J. Appl. Probab., 2013

2008

The cutoff phenomenon for randomized riffle shuffles.

Guan-Yu Chen, Laurent Saloff-Coste

Random Struct. Algorithms, 2008

1996

Computing Norms of group-Invariant Transition Operators.

Laurent Saloff-Coste, Wolfgang Woess

Comb. Probab. Comput., 1996

1995

Isoperimetric Inequalities and Decay of Iterated Kernels for almost-transitive Markov Chains.

Laurent Saloff-Coste

Comb. Probab. Comput., 1995

What do we know about the Metropolis algorithm?

Persi Diaconis, Laurent Saloff-Coste

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995