Short random walks on graphs

DOI10.1145/167088.167275MaRDI QIDQ5248544zbMATH OpenOpenAlexFDO

Authors Greg Barnes, Uriel Feige

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11858/00-001M-0000-0014-B790-8

Mathematics Subject Classification ID

Random walks on graphs (05C81) Graph algorithms (graph-theoretic aspects) (05C85)

Cited in

(6)

• Random walks and diffusion on networks
• Poisson approximation for non-backtracking random walks
• Sensitivity of mixing times in Eulerian digraphs
• A fast randomized LOGSPACE algorithm for graph connectivity
• A model of self-avoiding random walks for searching complex networks
• Memory efficient algorithms for cactus graphs and block graphs

This page was built for publication: Short random walks on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248544)