scientific article; zbMATH DE number 1563189

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

H. Ramesh, V. S. Anil Kumar

Publication date: 16 October 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

causal coupling methodconductance methodJerrum-Sinclair Markov chain

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs ⋮ Internal DLA on cylinder graphs: fluctuations and mixing ⋮ Unnamed Item

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