253 search results - page 24 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
123
click to vote
ADHOCNOW
2004
Springer
15 years 5 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
111
Voted
IJAHUC
2008
14 years 11 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
HICSS
2006
IEEE
15 years 5 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
CN
2000
14 years 11 months ago
2000
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
113
click to vote
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...