On the mixing time of the flip walk on triangulations of the sphere

From MaRDI portal
(Redirected from Publication:524867)




Abstract: A simple way to sample a uniform triangulation of the sphere with a fixed number n of vertices is a Monte-Carlo method: we start from an arbitrary triangulation and flip repeatedly a uniformly chosen edge. We give a lower bound in n5/4 on the mixing time of this Markov chain.









This page was built for publication: On the mixing time of the flip walk on triangulations of the sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q524867)