### 抄録

Random walk is a powerful tool for searching a network, especially for a very large network such as the Internet. The cover time is an important measure of a random walk on a finite graph, and has been studied well. For the purpose of searching a network, it is quite natural to think that multiple crawlers might cover a network faster than a single crawler. Alon et al. (2011) showed that a multiple random walk by k crawlers covers a network k times faster than a single random walk in certain graphs such as complete graphs, random graphs, etc., while the speeding up ratio is limited only to log k times in other graphs such as cycles and paths. This paper investigates a multiplex random walk by k tokens, in which k tokens randomly walks on a graph independently according to an individual transition probability. For the cover time of a multiplex random walk, we present new inequalities similar to celebrated Matthews' inequalities for a single random walk, that provide upper and lower bounds of the cover time by its hitting times. We also show that the bounds are tight in certain graphs, namely complete graphs, bipartite complete graphs, and random graphs.

元の言語 | 英語 |
---|---|

ホスト出版物のタイトル | Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 |

ページ | 872-877 |

ページ数 | 6 |

DOI | |

出版物ステータス | 出版済み - 10 18 2012 |

イベント | 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 - Shanghai, 中国 継続期間: 5 21 2012 → 5 25 2012 |

### 出版物シリーズ

名前 | Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 |
---|

### その他

その他 | 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012 |
---|---|

国 | 中国 |

市 | Shanghai |

期間 | 5/21/12 → 5/25/12 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software

### これを引用

*Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012*(pp. 872-877). [6270730] (Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012). https://doi.org/10.1109/IPDPSW.2012.107

**An extension of Matthews' bound to multiplex random walks.** / Hosaka, Yusuke; Yamauchi, Yukiko; Kijima, Shuji; Ono, Hirotaka; Yamashita, Masafumi.

研究成果: 著書/レポートタイプへの貢献 › 会議での発言

*Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012.*, 6270730, Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012, pp. 872-877, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012, Shanghai, 中国, 5/21/12. https://doi.org/10.1109/IPDPSW.2012.107

}

TY - GEN

T1 - An extension of Matthews' bound to multiplex random walks

AU - Hosaka, Yusuke

AU - Yamauchi, Yukiko

AU - Kijima, Shuji

AU - Ono, Hirotaka

AU - Yamashita, Masafumi

PY - 2012/10/18

Y1 - 2012/10/18

N2 - Random walk is a powerful tool for searching a network, especially for a very large network such as the Internet. The cover time is an important measure of a random walk on a finite graph, and has been studied well. For the purpose of searching a network, it is quite natural to think that multiple crawlers might cover a network faster than a single crawler. Alon et al. (2011) showed that a multiple random walk by k crawlers covers a network k times faster than a single random walk in certain graphs such as complete graphs, random graphs, etc., while the speeding up ratio is limited only to log k times in other graphs such as cycles and paths. This paper investigates a multiplex random walk by k tokens, in which k tokens randomly walks on a graph independently according to an individual transition probability. For the cover time of a multiplex random walk, we present new inequalities similar to celebrated Matthews' inequalities for a single random walk, that provide upper and lower bounds of the cover time by its hitting times. We also show that the bounds are tight in certain graphs, namely complete graphs, bipartite complete graphs, and random graphs.

AB - Random walk is a powerful tool for searching a network, especially for a very large network such as the Internet. The cover time is an important measure of a random walk on a finite graph, and has been studied well. For the purpose of searching a network, it is quite natural to think that multiple crawlers might cover a network faster than a single crawler. Alon et al. (2011) showed that a multiple random walk by k crawlers covers a network k times faster than a single random walk in certain graphs such as complete graphs, random graphs, etc., while the speeding up ratio is limited only to log k times in other graphs such as cycles and paths. This paper investigates a multiplex random walk by k tokens, in which k tokens randomly walks on a graph independently according to an individual transition probability. For the cover time of a multiplex random walk, we present new inequalities similar to celebrated Matthews' inequalities for a single random walk, that provide upper and lower bounds of the cover time by its hitting times. We also show that the bounds are tight in certain graphs, namely complete graphs, bipartite complete graphs, and random graphs.

UR - http://www.scopus.com/inward/record.url?scp=84867430779&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867430779&partnerID=8YFLogxK

U2 - 10.1109/IPDPSW.2012.107

DO - 10.1109/IPDPSW.2012.107

M3 - Conference contribution

AN - SCOPUS:84867430779

SN - 9780769546766

T3 - Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012

SP - 872

EP - 877

BT - Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012

ER -