Design and Application of Fast Random Walks Using Graph Topological Structures

• Project/Area Number: 22650004
• Research Category: Grant-in-Aid for Challenging Exploratory Research
• Allocation Type: Single-year Grants
• Research Field: Fundamental theory of informatics
• Research Institution: Kyushu University
• Principal Investigator: ONO Hirotaka 九州大学, 大学院・経済学研究院, 准教授 (00346826)
• Project Period (FY): 2010 – 2012
• Project Status: Completed (Fiscal Year 2012)
• Budget Amount: ¥3,370,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥570,000); Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2010: ¥900,000 (Direct Cost: ¥900,000)
• Keywords: MH アルゴリズム / グラフトポロジー / マルコフ連鎖 / ランダムウォーク / 全訪問時間 / 到達時間 / 有限グラフ / 次数情報 / 結合モデル / MHアルゴリズム

Research Abstract

A random walk on a finite graph is the model of repeatedly moving a particle on a vertex to one of its adjacent vertices. In this study, we obtain the following results: (1) we obtain inequalities about the relationship between hitting time and cover time of multiplex random walks, (2) for coalescing random walks, we obtain upper bounds on the expected coalescing time.

Research Products

• [Journal Article] On space complexity of self-stabilizing leader election in mediated population protocol (2012)
  • Author(s): R. Mizoguchi, H. Ono, S. Kijima, M. Yamashita
  • Journal Title: Distributed Computing Volume: 25 Pages: 451-460
  • NAID: 110007995639
  • URL: http://dx.doi.org/10.1007/s00446-012-0173-9
  • Peer Reviewed
• [Journal Article] Coalescing random walks and voting on graphs (2012)
  • Author(s): C. Cooper, R. Elsasser, H. Ono, T. Radzik
  • Journal Title: Proceeding PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing Pages: 47-56
  • URL: http://doi.acm.org/10.1145/2332432.2233244
  • Peer Reviewed
• [Journal Article] On the Approximability of Minimum Topic Connected Overlay and Its Special Instances (2012)
  • Author(s): J. Hosoda, J. Hromkovic, T. Izumi, H.Ono, Monika Steinova, K. Wada
  • Journal Title: Theoretical Computer Science Volume: 429 Pages: 144-154
  • URL: http://dx.doi.org/10.1016/j.tcs.2011.12.033
  • Peer Reviewed
• [Journal Article] An Extension of Matthews' Bound to Multiplex Random Walks (2012)
  • Author(s): Y. Hosaka, Y. Yamauchi, S. Kijima, H.Ono, M. Yamashita
  • Journal Title: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
  • URL: http://doi.ieeecomputersociety.org/10.1109/IPDPSW.2012.107
  • Peer Reviewed
• [Journal Article] Coalescing random walks and voting on graphs (2012)
  • Author(s): Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
  • Journal Title: Proceeding PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing Volume: - Pages: 47-56
  • DOI: 10.1145/2332432.2332440
  • Peer Reviewed
• [Journal Article] On the approximability and hardness of minimum topic connected overlay and its special instances (2012)
  • Author(s): J.Hosoda, J.Hromkovic, T.Izumi,, H.Ono, M.Steinova, K.Wada
  • Journal Title: Theoretical Computer Science Volume: 429 Pages: 144-154
  • DOI: 10.1016/j.tcs.2011.12.033
  • Peer Reviewed
• [Journal Article] An Extension of Matthews' Bound to Multiplex Random Walks (2012)
  • Author(s): Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita
  • Journal Title: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum Volume: - Pages: 872-877
  • DOI: 10.1109/ipdpsw.2012.107
  • Peer Reviewed
• [Journal Article] How Slow, or Fast, Are Standard Random Walks?-Analyses of Hitting and Cover Times on Tree (2011)
  • Author(s): Y.Nonaka, H.Ono, S.Kijima, K.Sadakane, M.Yamashita
  • Journal Title: CATS 2011, Proceedings Volume: CPRIT 119 Pages: 63-68
  • URL: http://crpit.com/abstracts/CRPITV119Nonaka.html
  • Peer Reviewed
• [Journal Article] Approximability of the Path-Distance- Width for AT-free Graphs (2011)
  • Author(s): Y. Otachi, T. Saitoh, K. Yamanaka, S. Kijima, Y. Okamoto, H. Ono, Y. Uno, K. Yamazaki
  • Journal Title: WG 2011: Lecture Notes in Computer Science Volume: 6986 Pages: 271-282
  • URL: http://dx.doi.org/10.1007/978-3-642-25870-1_25
  • Peer Reviewed
• [Journal Article] On the Approximability of Minimum Topic Connected Overlay and Its Special Instances (2011)
  • Author(s): J. Hosoda, J. Hromkovic, T. Izumi, H.Ono, Monika Steinova, K. Wada
  • Journal Title: MFCS 2011: Lecture Notes in Computer Science Volume: 6907 Pages: 376-387
  • URL: http://dx.doi.org/10.1007/978-3-642-22993-0_35
  • Peer Reviewed
• [Journal Article] Fast Random Walks on Finite Graphs and Graph Topological Information, Second International Conference on Networking and Computing (2011)
  • Author(s): H. Ono
  • Journal Title: ICNC 2011 Pages: 360-363
  • URL: http://doi.ieeecomputersociety.org/10.1109/ICNC.2011.70
• [Journal Article] On the Approximability of Minimum Topic Connected Overlay and Its Special Instances (2011)
  • Author(s): Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
  • Journal Title: MFCS Volume: 6986 Pages: 376-387
  • DOI: 10.1007/978-3-642-22993-0_35
  • ISBN: 9783642229923, 9783642229930
  • Peer Reviewed
• [Journal Article] Fast Random Walks on Finite Graphs and Graph Topological Information (2011)
  • Author(s): Hirotaka Ono
  • Journal Title: Second International Conference on Networking and Computing, ICNC 2011 Volume: - Pages: 360-363
  • DOI: 10.1109/icnc.2011.70
• [Journal Article] How Slow, or Fast, Are Standard Random Walks?-Analyses of Hitting and Cover. Times on Tree (2011)
  • Author(s): Y.Nonaka, H.Ono, S.Kijima, K.Sadakane, M.Yamashita
  • Journal Title: CATS 2011, Proceedings, CPRIT Volume: 119 Pages: 63-68
  • Peer Reviewed
• [Journal Article] Pattern Formation through Optimum Matching by Oblivious CORDA Robots (2010)
  • Author(s): N.Fujinaga, H.Ono, S.Kijima, M.Yamashita
  • Journal Title: OPODIS 2010, Lecture Notes in Computer Science Volume: 6490 Pages: 1-15
  • URL: http://dx.doi.org/10.1007/978-3-642-17653-1_1
  • Peer Reviewed
• [Journal Article] The hitting and cover times of Metropolis walks (2010)
  • Author(s): Y.Nonaka, H.Ono, K.Sadakane, M.Yamashita
  • Journal Title: Theoretical Computer Science Volume: 411 Pages: 1889-1894
  • NAID: 120005293255
  • Peer Reviewed
• [Presentation] Pattern Formation through Optimum Matching by Oblivious CORDA Robots (2012)
  • Author(s): N.Fujinaga, H.Ono, S.Kijima, M.Yamashita
  • Organizer: OPODIS 2010
  • Place of Presentation: チュニジア
  • Year and Date: 2012-12-14
• [Presentation] Coalescing random walks and voting on graphs Proceeding PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing (2012)
  • Author(s): C. Cooper, R. Elsasser, H. Ono, T. Radzik
  • Place of Presentation: ポルトガル
  • Year and Date: 2012-07-16
• [Presentation] An Extension of Matthews' Bound to Multiplex Random Walks (2012)
  • Author(s): Y. Hosaka, Y. Yamauchi, S. Kijima, H. Ono, M. Yamashita
  • Organizer: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum(2012)
  • Place of Presentation: 中国
  • Year and Date: 2012-05-21
• [Presentation] Coalescing random walks and voting on graphs (2012)
  • Author(s): Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
  • Organizer: PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
  • Place of Presentation: Funchal, Madeira, Portugal
• [Presentation] An Extension of Matthews' Bound to Multiplex Random Walks (2012)
  • Author(s): Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita
  • Organizer: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
  • Place of Presentation: Shanghai, China
• [Presentation] Fast Random Walks on Finite Graphs and Graph Topological Information, Second International Conference on Networking and Computing (2011)
  • Author(s): H. Ono
  • Organizer: ICNC 2011
  • Place of Presentation: 日本
  • Year and Date: 2011-12-01
• [Presentation] Fast Random Walks on Finite Graphs and Graph Topological Information (2011)
  • Author(s): Hirotaka Ono
  • Organizer: Second International Conference on Networking and Computing, ICNC 2011
  • Place of Presentation: 大阪大学(招待講演)
  • Year and Date: 2011-12-01
• [Presentation] On the Approximability of Minimum Topic Connected Overlay and Its Special Instances (2011)
  • Author(s): J. Hosoda, J. Hromkovic, T. Izumi, H. Ono, Monika Steinova, K. Wada
  • Organizer: MFCS 2011: Lecture Notes in Computer Science
  • Place of Presentation: ポーランド
  • Year and Date: 2011-08-25
• [Presentation] Approximability of the Path-Distance- Width for AT-free Graphs (2011)
  • Author(s): Y. Otachi, T. Saitoh, K. Yamanaka, S. Kijima, Y. Okamoto, H. Ono, Y. Uno, K. Yamazaki
  • Organizer: WG 2011
  • Place of Presentation: チェコ
  • Year and Date: 2011-06-22
• [Presentation] How Slow, or Fast, Are Standard Random Walks?-Analyses of Hitting and Cover. Times on Tree (2011)
  • Author(s): Y.Nonaka, H.Ono, S.Kijima, K.Sadakane, M.Yamashita
  • Organizer: CATS 2011
  • Place of Presentation: オーストラリア
  • Year and Date: 2011-01-19
• [Presentation] 木上のランダムウォーク高速化の可能性 (2010)
  • Author(s): 野中良哲, 小野廣隆, 来嶋秀治, 山下雅史
  • Organizer: 2010 年度 夏のLA シンポジウム
  • Place of Presentation: 九殿浜温泉 ひみのはな
  • Year and Date: 2010-07-21
• [Presentation] 木上のランダムウォーク高速化の可能性 (2010)
  • Author(s): 野中良哲, 小野廣隆, 来嶋秀治, 山下雅史
  • Organizer: 2010年度 夏のLAシンポジウム
  • Place of Presentation: 九殿浜温泉 ひみのはな
  • Year and Date: 2010-07-21
• [Remarks]
  • URL: http://www.en.kyushu-u.ac.jp/hirotaka/
• [Remarks]
  • URL: http://hyoka.ofc.kyushu-u.ac.jp/search/details/K000224/research.html
• [Remarks]
  • URL: http://hyoka.ofc.kyushu-u.ac.jp/search/details/K000224/research.html