Name
Abstract | ||
|---|---|---|
We study a discrete time self-interacting random process on graphs, which we call greedy random walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not yet been crossed by the walker. At each step, the walker, being at some vertex, picks an adjacent edge among the edges that have not traversed thus far according to some (deterministic or randomized) rule. If all the adjacent edges have already been traversed, then an adjacent edge is chosen uniformly at random. After picking an edge the walker jumps along it to the neighbouring vertex. We show that the expected edge cover time of the greedy random walk is linear in the number of edges for certain natural families of graphs. Examples of such graphs include the complete graph, even degree expanders of logarithmic girth, and the hypercube graph. We also show that GRW is transient in Z(d) for all d >= 3. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1017/S0963548313000552 | COMBINATORICS PROBABILITY & COMPUTING |
Keywords | DocType | Volume |
discrete time,random process,data structure,random walk | Journal | 23 |
Issue | ISSN | Citations |
2 | 0963-5483 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tal Orenshtein | 1 | 0 | 0.68 |
| Igor Shinkar | 2 | 24 | 8.97 |