Improving resource location with locally precomputed partial random walks

DOI10.1007/s00607-013-0353-xzbMath1338.68025arXiv1304.5100OpenAlexW2031616556MaRDI QIDQ497106

Yong-Cai Geng, Sumit K. Garg

Publication date: 23 September 2015

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.5100

zbMATH Keywords

random walkspartial random walksresource locationsearch lengthself-avoiding random walks

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• Performance of random walks in one-hop replication networks
• A model of self‐avoiding random walks for searching complex networks
• Network Applications of Bloom Filters: A Survey
• Distributed Random Walks

This page was built for publication: Improving resource location with locally precomputed partial random walks