On the expected distance of a random walk Online publication date: Thu, 30-Apr-2015
by Trevor S. Hale; Faizul Huq; Heather Lutz; Carles Moslares
International Journal of Mathematics in Operational Research (IJMOR), Vol. 7, No. 3, 2015
Abstract: This paper investigates the Euclidean length of a random walk though n coplanar points. The length of which has multiple applications including spanning trees, Steiner trees, and certain forms of the travelling salesman problem. To estimate this distance, we partition an area A into m equivalent squares and then add the expected Euclidean distances travelled between each of the m squares with the expected Euclidean distances travelled within each of the m squares. The end result is a closed form model for the expected length of a random walk through n coplanar points. Some avenues of future research are also included.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com