An optimal path finding strategy in networks based on random walk.
Bin HuHuanyan QianYi ShenJia-xing YanPublished in: Clust. Comput. (2016)
Keyphrases
- random walk
- path finding
- average degree
- optimal path
- markov chain
- path planning
- directed graph
- dynamic programming
- markov random walk
- transition probabilities
- search algorithm
- transition probability matrix
- network structure
- complex networks
- flow graph
- heuristic search
- concept learning
- complexity analysis
- lower bound
- tree search
- optimal solution
- social networks