Derandomizing random walks in undirected graphs using locally fair exploration strategies.
Colin CooperDavid IlcinkasRalf KlasingAdrian KosowskiPublished in: Distributed Comput. (2011)
Keyphrases
- random walk
- directed graph
- undirected graph
- average degree
- markov chain
- directed acyclic graph
- link prediction
- disjoint paths
- strongly connected
- approximation algorithms
- graph structure
- transition probabilities
- markov random walk
- spectral methods
- vertex set
- pairwise
- markov models
- graph structures
- adjacency matrix
- web graph
- connected components
- complex networks
- data mining