On the expected distance of a random walk

Trevor S. Hale, Faizul Huq, Heather Lutz and Carles Moslares

International Journal of Mathematics in Operational Research, 2015, vol. 7, issue 3, 241-250

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.

Keywords: expected distance; random walk; Euclidean TSP; travelling salesman problem; Euclidean distances; Euclidean length. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=69135 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:7:y:2015:i:3:p:241-250

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().