A random walk perspective on hide-and-seek games

DOI10.1088/1751-8121/aafc92zbMath1505.05116arXiv1809.08222OpenAlexW2889939696MaRDI QIDQ5051142

Reimer Kühn, Shubham Pandey

Publication date: 18 November 2022

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.08222

zbMATH Keywords

random walksrandom matricessearchcomplex networksnetwork exploration

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Sums of independent random variables; random walks (60G50) Games on graphs (graph-theoretic aspects) (05C57) Random walks on graphs (05C81)

Related Items

Exact and approximate mean first passage times on trees and other necklace structures: a local equilibrium approach, Constructions and properties of a class of random scale-free networks

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Patrolling Games
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• The eigenvalue spectrum of a large symmetric random matrix
• Search Theory
• First-Passage Phenomena and Their Applications
• The average number of distinct sites visited by a random walker on random graphs
• The Cover Time of Random Regular Graphs
• Collective dynamics of ‘small-world’ networks
• Elements of Information Theory