Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A property of random walks on a cycle graph

A property of random walks on a cycle graph We analyze the Hunter vs. Rabbit game on a graph, which is a model of communication in adhoc mobile networks. Let G be a cycle graph with N nodes. The hunter can move from a vertex to a vertex along an edge. The rabbit can jump from any vertex to any vertex on the graph. We formalize the game using the random walk framework. The strategy of the rabbit is formalized using a one dimensional random walk over [InlineMediaObject not available: see fulltext.]. We classify strategies using the order O(k −β−1) of their Fourier transformation. We investigate lower bounds and upper bounds of the probability that the hunter catches the rabbit. We found a constant lower bound if β∈(0,1) which does not depend on the size N of the graph. We show the order is equivalent to O(1/logN) if β=1 and a lower bound is 1/N (β−1)/β if β∈(1,2]. These results help us to choose the parameter β of a rabbit strategy according to the size N of the given graph. We introduce a formalization of strategies using a random walk, theoretical estimation of bounds of a probability that the hunter catches the rabbit, and also show computing simulation results. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Pacific Journal of Mathematics for Industry Springer Journals

A property of random walks on a cycle graph

Download PDF
14 pages

Loading next page...
 
/lp/springer_journal/a-property-of-random-walks-on-a-cycle-graph-2fsxVr0Fs6

References (24)

Publisher
Springer Journals
Copyright
Copyright © 2015 by Ikeda et al.; licensee Springer.
Subject
Mathematics; Applications of Mathematics; Quantitative Finance; Mathematical Applications in Computer Science; Mathematical Applications in the Physical Sciences; Mathematical Modeling and Industrial Mathematics; Math Applications in Computer Science
eISSN
2198-4115
DOI
10.1186/s40736-015-0015-3
Publisher site
See Article on Publisher Site

Abstract

We analyze the Hunter vs. Rabbit game on a graph, which is a model of communication in adhoc mobile networks. Let G be a cycle graph with N nodes. The hunter can move from a vertex to a vertex along an edge. The rabbit can jump from any vertex to any vertex on the graph. We formalize the game using the random walk framework. The strategy of the rabbit is formalized using a one dimensional random walk over [InlineMediaObject not available: see fulltext.]. We classify strategies using the order O(k −β−1) of their Fourier transformation. We investigate lower bounds and upper bounds of the probability that the hunter catches the rabbit. We found a constant lower bound if β∈(0,1) which does not depend on the size N of the graph. We show the order is equivalent to O(1/logN) if β=1 and a lower bound is 1/N (β−1)/β if β∈(1,2]. These results help us to choose the parameter β of a rabbit strategy according to the size N of the given graph. We introduce a formalization of strategies using a random walk, theoretical estimation of bounds of a probability that the hunter catches the rabbit, and also show computing simulation results.

Journal

Pacific Journal of Mathematics for Industry – Springer Journals

Published: Jun 2, 2015

There are no references for this article.