253 search results - page 4 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
CAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
SIGMETRICS
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
EMNLP
2011
12 years 7 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...