Talks
Follow the files of some given talks, without the jokes but the latest (and hopefully the most exact) version:
On finite interweaving relations
Quantum walks, the discrete wave equation and Chebyshev polynomials
On fraudulent stochastic algorithms
On swarm algorithms
At the end of the talk two simulations are presented, due to Lénaïc Chizat. They can be downloaded from the following links:
Swarm algorithm
Independent simulated annealing
On random walks on the random graph
Optimal epidemic suppression under an ICU constraint
Higher order Cheeger inequalities for Steklov eigenvalues
On the construction of set-valued dual processes
On Markov intertwinings
(with a section on random mappings)
On Markov intertwinings
(with a section on top-to-random shuffle)
On the speed of convergence of Heisenberg random walks
On quantitative convergence to quasi-stationarity
Strong stationary times for one-dimensional diffusions
On hyperboundedness and spectrum of Markov operators
On the spectral analysis of second-order Markov chains
On the cut-off phenomenon for the transitivity of randomly generated subgroups
On characterizations of Metropolis type algorithms in continuous time