Publication:4761354
From MaRDI portal
DOI<1::AID-RSA1>3.0.CO;2-7 10.1002/1098-2418(200101)18:1<1::AID-RSA1>3.0.CO;2-7zbMath0970.60086MaRDI QIDQ4761354
Publication date: 16 October 2001
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On coupling and the approximation of the permanent
- Polynomial-Time Approximation Algorithms for the Ising Model
- Approximating the Permanent
- A maximal coupling for Markov chains
- Random walks in a convex body and an improved volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- The time complexity of maximum matching by simulated annealing
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Convergence Rates for Markov Chains