Random walks on graphs and Monte Carlo methods

DOI10.1016/j.matcom.2015.12.006OpenAlexW2221586932MaRDI QIDQ2229041

Jim Cox, Wen-Ju Cheng, Paula A. Whitlock

Publication date: 19 February 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2015.12.006

zbMATH Keywords

random walksMarkov chain Monte Carlograph theory

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
• Hardness vs randomness
• The electrical resistance of a graph captures its commute and cover times
• Laplacians and the Cheeger inequality for directed graphs
• Random Walks on Some Basic Classes of Digraphs
• Generalizing Sudoku to three dimensions
• S-T connectivity on digraphs with a known stationary distribution
• Undirected ST-connectivity in log-space
• Percolation theory on directed graphs
• A tight upper bound on the cover time for random walks on graphs
• An O (log( n ) ^4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs