Random walks with “back buttons” (extended abstract)

DOI10.1145/335305.335362zbMATH Open1296.60191OpenAlexW2010994761MaRDI QIDQ3192018FDOQ3192018

Authors Ronald Fagin, Anna R. Karlin, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Andrew Tomkins, Jon M. Kleinberg, Madhu Sudan

Publication date 26 September 2014

Published in Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/335305.335362

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Internet topics (68M11)

Recommendations

• Random walks with ``back buttons
• Remarks on the recurrence and transience of non-backtracking random walks
• Mixing rates of random walks with little backtracking
• Non-backtracking random walk
• A note on recurrent random walks
• scientific article; zbMATH DE number 1861566
• Reversibility of the non-backtracking random walk
• Publication:4952333
• On a random walk with switchings

Cited in

(5)

• A Theory for Backtrack-Downweighted Walks
• Qualitative reachability in stochastic BPA games
• Recursive stochastic games with positive rewards
• Random walks with ``back buttons
• Recursive Markov decision processes and recursive stochastic games

This page was built for publication: Random walks with “back buttons” (extended abstract)

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