|
| 摘要: |
| 本文考虑了n个定点的圈上的多重懒惰随机游走.利用偶和方法证明了其最大相遇时的期望的阶数为hmax×log n，其中hmax为圈上的一简单随机游走的最大击中时. |
| 关键词: 多重懒惰随机游走 相遇时 击中时 |
| DOI： |
| 分类号:O211.62 |
| 基金项目:国家自然科学基金NSFC（11401127）；广西自然科学基金GXNSF（2014GXNSFCA118015；2014GXNSFBA118006）及桂林理工大学启动金. |
|
| MULTIPLE LAZY RANDOM WALKS ON CYCLES |
|
WANG Bin
|
| Abstract: |
| In this note, for the multiple lazy random walks on cycle with n vertices. By coupling method, we prove that the expectation of the maximum of meeting times is of order hmax×log n, where hmax is the maximum of hitting time for a simple random walk on cycles with n vertices. |
| Key words: multiple random walks hitting time meeting time |
