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.
Pacific Journal of Mathematics for Industry – Springer Journals
Published: Jun 2, 2015
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera