Improved mixing for the convex polygon triangulation flip walk

07/20/2022
by   David Eppstein, et al.
0

We prove that the well-studied triangulation flip walk on a convex point set mixes in time O(n^4.75), the first progress since McShine and Tetali's O(n^5 log n) bound in 1997. In the process we determine the expansion of the associahedron graph K_n up to a factor of O(n^3/4). To obtain these results, we extend a framework we developed in a previous preprint–extending the projection-restriction technique of Jerrum, Son, Tetali, and Vigoda–for establishing conditions under which the Glauber dynamics on independent sets and other combinatorial structures mix rapidly.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2021

Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs

We give a new rapid mixing result for a natural random walk on the indep...
research
10/23/2017

Fast MCMC sampling algorithms on polytopes

We propose and analyze two new MCMC sampling algorithms, the Vaidya walk...
research
04/30/2019

Computing the hull number in toll convexity

A walk W between vertices u and v of a graph G is called a tolled walk ...
research
05/10/2023

Optimal mixing of the down-up walk on independent sets of a given size

Let G be a graph on n vertices of maximum degree Δ. We show that, for an...
research
12/01/2022

Hit-and-run mixing via localization schemes

We analyze the hit-and-run algorithm for sampling uniformly from an isot...
research
01/09/2020

Improved Analysis of Higher Order Random Walks and Applications

The motivation of this work is to extend the techniques of higher order ...
research
12/11/2018

Distribution-free properties of isotonic regression

It is well known that the isotonic least squares estimator is characteri...

Please sign up or login with your details

Forgot password? Click here to reset