A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs.
Catherine S. GreenhillPublished in: Electron. J. Comb. (2011)
Keyphrases
- markov chain
- directed graph
- random walk
- monte carlo
- markov chain monte carlo
- transition matrix
- gibbs sampler
- steady state
- finite state
- transition probabilities
- markov model
- markov process
- upper bound
- monte carlo method
- stationary distribution
- monte carlo simulation
- lower bound
- worst case
- state space
- graph structure
- random sampling
- gibbs sampling
- directed acyclic graph
- parameter space
- undirected graph
- disjoint paths
- social networks
- markov models
- web graph
- link prediction
- higher order
- search space
- reinforcement learning