scientific article; zbMATH DE number 2019625

zbMATH Open1028.68099MaRDI QIDQ4440428FDOQ4440428

Authors: Martin Dyer, Eric Vigoda, Mark Jerrum 

Publication date: 17 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830068.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2151251
• Fastest Mixing Markov Chain on a Graph
• Fastest Mixing Reversible Markov Chains on Graphs With Degree Proportional Stationary Distributions
• Fastest mixing Markov chain on graphs with symmetries
• The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
• Constrained Markovian dynamics of random graphs
• A more rapidly mixing Markov chain for graph colorings
• Characterizing limits and opportunities in speeding up Markov chain mixing
• Algorithms and Computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Title not available (Why is that?)
• Counting and sampling \(H\)-colourings
• Gibbs measures and dismantlable graphs
• Strong spatial mixing in homomorphism spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440428)