For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Topology-Aware Random Walk
InKwan YU Richard NEWMAN
IEICE TRANSACTIONS on Communications
Publication Date: 2012/03/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: LETTER
topology-aware, random walk,
Full Text: PDF>>
When a graph can be decomposed into components of well-connected subgraphs, it is possible to speed up random walks by taking advantage of topology of the graph. In this paper, a modified Metropolis random walk scheme is introduced and conditions are given when it performs better than the original Metropolis algorithm.