%0 Journal Article
%T 圈上的多重懒惰随机游走<br>MULTIPLE LAZY RANDOM WALKS ON CYCLES
%A 作者
%A 王彬
%J 数学杂志
%D 2017
%X 本文考虑了n个定点的圈上的多重懒惰随机游走.利用偶和方法证明了其最大相遇时的期望的阶数为hmax×log n，其中hmax为圈上的一简单随机游走的最大击中时.<br>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
%K 多重懒惰随机游走 相遇时 击中时&lt
%K br&gt
%K multiple random walks hitting time meeting time
%U http://sxzz.whu.edu.cn/sxzz/ch/reader/view_abstract.aspx?file_no=20170522&flag=1