77 search results - page 4 / 16 » Sampling directed graphs with random walks |
PODC
2009
ACM
14 years 7 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
HICSS
2006
IEEE
14 years 1 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
13 years 7 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 ...