253 search results - page 11 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
KDD
2007
ACM
14 years 9 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
RSA
2008
13 years 8 months ago
2008
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 ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...