A property of random walks on a cycle graph

DOI10.1186/s40736-015-0015-3zbMath1415.91069arXiv1501.05066OpenAlexW1521513224WikidataQ59404195 ScholiaQ59404195MaRDI QIDQ740121

Yoshihiro Mizoguchi, Yuki Ikeda, Yasunari Fukai

Publication date: 12 August 2016

Published in: Pacific Journal of Mathematics for Industry (Search for Journal in Brave)

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

zbMATH Keywords

graph theoryrandom walkcombinatorial probabilityadhoc network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57) Random walks on graphs (05C81)

Cites Work

• Searching and pebbling
• Hunter, Cauchy rabbit, and optimal Kakeya sets
• The complexity of searching a graph
• Searching for a Mobile Intruder in a Polygonal Region
• Search Games with Mobile and Immobile Hider
• Randomized Pursuit-Evasion in Graphs
• Recontamination does not help to search a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A property of random walks on a cycle graph