Flip sur les triangulations de la sphere : une borne inférieure pour les temps de mélange
One of the simplest ways to sample a uniform triangulation of the sphere with a fixed number n of faces is a Monte-Carlo method: we start from an arbitrary triangulation and flip repeatedly a uniformly chosen edge, i.e. we delete it and replace it with the other diagonal of the quadrilateral that appears. We will prove a lower bound of order n^{5/4} on the mixing time of this Markov chain.