| Presentation | 2021-09-08 Analysis of Diverse Random Walks with Different Transition Probabilities and Different Moving Frequencies Using Spectral Graph Theory Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The first meeting time is defined by the time it takes for multiple mobile agents starting random walks from different nodes on a graph to first meet at the same node, and is closely related to the rendezvous problem, which is a essential graph problem in computer science. Hence, understanding the characteristics of the first meeting time is important to design an efficient rendezvous algorithm on a graph. In the previous work, we analyzed two mobile agents performing random walks, and clarified the characteristics in their first meeting time. However, the previous work assumed that each mobile agent performs a random walk under the same condition. In this paper, we conduct the analysis of two mobile agents performing diverse random walks, and derive the spectral formula for the expected value of the first meeting time. In the diverse random walks, a mobile agent can (a) follow the different transition probabilities, and (b) move with the different frequencies, than another mobile agent. Moreover, we conduct simulation experiments to clarify the validity of the derived spectral formula for the expected value of the first meeting time. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Spectral Graph Theory / Rendezvous Problem / Random Walk / First Meeting Time |
| Paper # | IA2021-17 |
| Date of Issue | 2021-09-01 (IA) |
| Conference Information | |
| Committee | IA |
|---|---|
| Conference Date | 2021/9/8(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Internet Operation and Management, etc. |
| Chair | Tomoki Yoshihisa(Osaka Univ.) |
| Vice Chair | Toru Kondo(Hiroshima Univ.) / Yuichiro Hei(KDDI Research) / Hiroshi Yamamoto(Ritsumeikan Univ.) |
| Secretary | Toru Kondo(Osaka Univ.) / Yuichiro Hei(Kogakuin Univ.) / Hiroshi Yamamoto(NEC) |
| Assistant | Daisuke Kotani(Kyoto Univ.) / Ryo Nakamurai(Fukuoka Univ.) / Daiki Nobayashi(Kyushu Inst. of Tech.) |
| Paper Information | |
| Registration To | Technical Committee on Internet Architecture |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Analysis of Diverse Random Walks with Different Transition Probabilities and Different Moving Frequencies Using Spectral Graph Theory |
| Sub Title (in English) | |
| Keyword(1) | Spectral Graph Theory |
| Keyword(2) | Rendezvous Problem |
| Keyword(3) | Random Walk |
| Keyword(4) | First Meeting Time |
| 1st Author's Name | Nanami Tsuji |
| 1st Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| 2nd Author's Name | Fumiya Toyoda |
| 2nd Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| 3rd Author's Name | Yusuke Sakumoto |
| 3rd Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| 4th Author's Name | Hiroyuki Ohsaki |
| 4th Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| Date | 2021-09-08 |
| Paper # | IA2021-17 |
| Volume (vol) | vol.121 |
| Number (no) | IA-167 |
| Page | pp.pp.14-21(IA), |
| #Pages | 8 |
| Date of Issue | 2021-09-01 (IA) |