How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph.
James Gary ProppDavid Bruce WilsonPublished in: J. Algorithms (1998)
Keyphrases
- markov chain
- directed graph
- random sample
- spanning tree
- random walk
- transition matrix
- undirected graph
- monte carlo method
- random sampling
- edge weights
- transition probabilities
- sample size
- minimum cost
- monte carlo
- state space
- version space
- graph structure
- directed acyclic graph
- objective function
- link prediction
- upper bound
- special case
- active learning