304views Data Mining» more  SDM 2012»
6 years 5 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
111views more  SIAMDM 2010»
7 years 10 months ago
Random Walks with Look-Ahead in Scale-Free Random Graphs
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...
Colin Cooper, Alan M. Frieze
97views more  JCAM 2010»
7 years 10 months ago
Random walk with long-range interaction with a barrier and its dual: Exact results
We consider the random walk on Z+ = {0, 1, ...} , with up and down transition probabilities given the chain is in state x {1, 2, ...}: (1) px = 1 2 ,, 1 2x +
Thierry Huillet
7 years 11 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
136views Hardware» more  ICCAD 2009»
8 years 1 months ago
A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
8 years 1 months ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...
8 years 1 months ago
Automatic Keyphrase Extraction via Topic Decomposition
Existing graph-based ranking methods for keyphrase extraction compute a single importance score for each word via a single random walk. Motivated by the fact that both documents a...
Zhiyuan Liu, Wenyi Huang, Yabin Zheng, Maosong Sun
118views more  RSA 2008»
8 years 2 months ago
The cover time of the giant component of a random graph
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
Colin Cooper, Alan M. Frieze
196views more  PAMI 2007»
8 years 2 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
144views more  MOC 1998»
8 years 2 months ago
Convergence of a random walk method for a partial differential equation
Abstract. A Cauchy problem for a one–dimensional diffusion–reaction equation is solved on a grid by a random walk method, in which the diffusion part is solved by random walk...
Weidong Lu