On the switch Markov chain for perfect matchings
From MaRDI portal
Publication:4640285
Recommendations
Cited in
(22)- Counting independent sets in graphs with bounded bipartite pathwidth
- Zero-freeness and approximation of real Boolean Holant problems
- Graph classes and the switch Markov chain for matchings
- The Perfect Matching Reconfiguration Problem
- The Effect of Boundary Conditions on Mixing Rates of Markov Chains
- Random walks on trees and matchings
- On the switch Markov chain for perfect matchings
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
- Counting perfect matchings and the switch chain
- Parikh word representability of bipartite permutation graphs
- Sequential importance sampling for estimating the number of perfect matchings in bipartite graphs: an ongoing conversation with Laci
- Complexity of Hamiltonian cycle reconfiguration
- Sampling weighted perfect matchings on the square-octagon lattice
- The mixing time of switch Markov chains: a unified approach
- Quasimonotone graphs
- Rapid mixing of the switch Markov chain for 2-class joint degree matrices
- Sampling weighted perfect matchings on the square-octagon lattice
- Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
- Quasimonotone graphs
- Efficient, local and symmetric Markov chains that generate one-factorizations
- Permanental generating functions and sequential importance sampling
- Efficient generation of random derangements with the expected distribution of cycle lengths
This page was built for publication: On the switch Markov chain for perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640285)