2012 Fiscal Year Final Research Report
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
|
| Keywords | 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
(18 results)
