Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs

We study Markov chains for $\alpha$-orientations of plane graphs, these are orientations where the outdegree of each vertex is prescribed by the value of a given function $\alpha$. The set of $\alpha$-orientations of a plane graph has a natural distributive lattice structure. The moves of the up-dow...

Full description

Bibliographic Details
Main Authors: Stefan Felsner, Daniel Heldt
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2017-02-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/1376/pdf