On the switch Markov chain for perfect matchings

DOI10.1137/1.9781611974331.ch138zbMath1412.60105arXiv1501.07725WikidataQ59895106 ScholiaQ59895106MaRDI QIDQ4575722

Martin Dyer, Haiko Müller, Mark R. Jerrum

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.07725

Mathematics Subject Classification ID

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

37A50: Dynamical systems and their relations with probability theory and stochastic processes

Related Items

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs