Very rapidly mixing Markov chains for 2-colorings and for independent sets in a graph with maximum degree 4.
Michael MolloyPublished in: Random Struct. Algorithms (2001)
Keyphrases
- markov chain
- random walk
- transition matrix
- steady state
- monte carlo
- transition probabilities
- finite state
- markov model
- stationary distribution
- markov process
- stochastic process
- monte carlo method
- markov processes
- state space
- monte carlo simulation
- directed graph
- probabilistic automata
- graph mining
- graph structure
- probabilistic model
- graph coloring
- spanning tree
- queueing networks
- machine learning
- information theory
- hidden markov models