Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
25,285
Multiple random walks in random regular graphs
"... We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with hig ..."
Abstract
-
Cited by 28 (6 self)
- Add to MetaCart
We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown
Research Article Comparison of Multiple Random Walks Strategies for Searching Networks
"... Title Comparison of multiple random walks strategies forsearching networks ..."
Abstract
- Add to MetaCart
Title Comparison of multiple random walks strategies forsearching networks
Tight Bounds for the Cover Time of Multiple Random Walks
, 2009
"... We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the speed-up defined as the ratio between the cover time of one and the cover time of k random walks. Recently Alon et al. ..."
Abstract
-
Cited by 17 (2 self)
- Add to MetaCart
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the speed-up defined as the ratio between the cover time of one and the cover time of k random walks. Recently Alon et al
Multiple random walks and interacting particle systems
- IN: 36TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP
, 2009
"... ..."
The 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC’07) SEARCHING WITH MULTIPLE RANDOM WALK QUERIES
"... We analyze the performance of searching with multiple random walk queries on Erdös-Rényi (ER) random graphs and power law graphs generated using preferential attachment. Our simulations show that searching with multiple random walk queries reduces message overhead as compared to flooding with sequen ..."
Abstract
- Add to MetaCart
We analyze the performance of searching with multiple random walk queries on Erdös-Rényi (ER) random graphs and power law graphs generated using preferential attachment. Our simulations show that searching with multiple random walk queries reduces message overhead as compared to flooding
Multiple Random Walks to Uncover Short Paths in Power Law Networks
"... Abstract—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest in network science. Consider the following routing problem in the context of a large power law network G. A small ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
of random walks (RWs) to crawl G. We show that RWs have the ability to find short paths and that this bears no relation to the paths that they take. Instead, it relies on two properties of RWs on power law networks: • The RW ability to observe a sizable fraction of the network edges; • The near certainty
Improving the Scalability of Search in Networks Through Multiple Random Walks
"... Efficient search for and location of content and resources is of fundamental importance in a wide variety of today’s net-works. These range from peer-to-peer (P2P) networks such as BitTorrent to online social networks such as Facebook, ..."
Abstract
- Add to MetaCart
Efficient search for and location of content and resources is of fundamental importance in a wide variety of today’s net-works. These range from peer-to-peer (P2P) networks such as BitTorrent to online social networks such as Facebook,
Search and replication in unstructured peer-to-peer networks
, 2002
"... Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the flooding-based query algorithm used in Gnutella does n ..."
Abstract
-
Cited by 692 (6 self)
- Add to MetaCart
propose a query algorithm based on multiple random walks that resolves queries almost as quickly as gnutella's flooding method while reducing the network traffic by two orders of mag-nitude in many cases. We also present a distributed replication strategy that yields close-to-optimal performance
Results 1 - 10
of
25,285
