A Markov chain model for the search time for max degree nodes in a graph using a biased random walk.
Jonathan StokesSteven WeberPublished in: CISS (2016)
Keyphrases
- random walk
- markov chain
- transition probabilities
- directed graph
- stationary distribution
- markov random walk
- markov model
- transition matrix
- markov process
- flow graph
- monte carlo method
- steady state
- hyper graph
- transition probability matrix
- monte carlo simulation
- monte carlo
- average degree
- nodes of a graph
- bayesian learning
- link prediction
- maximum entropy
- probabilistic model
- search algorithm
- social networks