733 search results - page 15 / 147 » Recommending random walks |
TC
2008
14 years 9 months ago
2008
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
81
Voted
CSC
2008
14 years 11 months ago
2008
I show how to design the value of the diffusion constant D for the random walks of Squares and Triangles over their respective regular lattice in two-dimensions. By allowing moveme...
77
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
69
Voted
DC
2000
14 years 9 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...