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 *help |
¥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.
|
Report
(4 results)
Research Products
(31 results)
