A stopping criterion for Markov chains when generating independent random graphs.
Jaideep RayAli PinarC. SeshadhriPublished in: J. Complex Networks (2015)
Keyphrases
- markov chain
- random graphs
- stopping criterion
- steady state
- graph theoretic
- finite state
- transition probabilities
- phase transition
- convergence rate
- stationary distribution
- markov model
- probabilistic automata
- state space
- random walk
- markov processes
- undirected graph
- transition matrix
- cost function
- small world
- region merging
- image processing
- probabilistic model
- lower bound