共 50 条
Random walks on graphs and Monte Carlo methods
被引:6
|作者:
Cheng, Wen-Ju
[1
]
Cox, Jim
[2
]
Whitlock, Paula
[2
]
机构:
[1] CUNY, Grad Ctr, Comp Sci, Fifth Ave, New York, NY USA
[2] CUNY Brooklyn Coll, CIS Dept, 2900 Bedford Ave, Brooklyn, NY 11210 USA
关键词:
Graph theory;
Random walks;
Markov chain Monte Carlo;
DIRECTED-GRAPHS;
D O I:
10.1016/j.matcom.2015.12.006
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
This paper relates the study of random walks on graphs and directed graphs to random walks that arise in Monte Carlo methods applied to optimization problems. Previous results on simple graphs are surveyed and new results on the mixing times for Markov chains are derived. (C) 2016 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:86 / 94
页数:9
相关论文