A Markov chain model for the search time for max degree nodes in a graph using a biased random walk.
Jonathan StokesSteven WeberPublished in: CoRR (2016)
Keyphrases
- random walk
- markov chain
- transition probabilities
- stationary distribution
- directed graph
- markov process
- markov random walk
- markov model
- transition probability matrix
- flow graph
- monte carlo simulation
- monte carlo method
- hyper graph
- transition matrix
- proximity measures
- probabilistic model
- nodes of a graph
- steady state
- search algorithm
- average degree
- markov models
- bayesian framework
- graph structure
- maximum entropy
- network structure
- state space