Cited By
View all- Berenbrink PKlasing RKosowski AMallmann-Trenn FUznański P(2018)Improved Analysis of Deterministic Load-Balancing SchemesACM Transactions on Algorithms10.1145/328243515:1(1-22)Online publication date: 16-Nov-2018
The Propp Machine is a deterministic process that simulates a random walk. Instead of distributing chips randomly, each position makes the chips move according to the walk's possible steps in a fixed order. A random walk is called Proppian if at each ...
The short-term behavior of random walks on graphs is studied, in particular, the rate at which a random walk discovers new vertices and edges. A conjecture by Linial that the expected time to find $\cal N$ distinct vertices is $O({\cal N}^{3})$ is ...
Random walk is a powerful tool, not only for modeling, but also for practical use such as the Internet crawlers. Standard random walks on graphs have been well studied; It is well-known that both hitting time and cover time of a standard random walk are ...
John Wiley & Sons, Inc.
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in