Subexponential mixing for partition chains on grid-like graphs

DOI10.1137/1.9781611977554.CH127arXiv2206.00579MaRDI QIDQ6400829FDOQ6400829

Wesley Pegden, Alan Frieze

Publication date: 1 June 2022

Abstract: We consider the problem of generating uniformly random partitions of the vertex set of a graph such that every piece induces a connected subgraph. For the case where we want to have partitions with linearly many pieces of bounded size, we obtain approximate sampling algorithms based on Glauber dynamics which are fixed-parameter tractable with respect to the bandwidth of $G$, with simple-exponential dependence on the bandwidth. For example, for rectangles of constant or logarithmic width this gives polynomial-time sampling algorithms. More generally, this gives sub-exponential algorithms for bounded-degree graphs without large expander subgraphs (for example, we obtain $O(2^{sqrtn})$ time algorithms for square grids). In the case where we instead want partitions with a small number of pieces of linear size, we show that Glauber dynamics can have exponential mixing time, even just for the case of 2 pieces, and even for 2-connected subgraphs of the grid with bounded bandwidth.

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Subexponential mixing for partition chains on grid-like graphs

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