On the expected distance of a random walk

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

Producció científica: Article en revista indexadaArticleAvaluat per experts

4 Cites (Scopus)

Resum

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.

Idioma originalAnglès
Pàgines (de-a)241-250
Nombre de pàgines10
RevistaInternational Journal of Mathematics in Operational Research
Volum7
Número3
DOIs
Estat de la publicacióPublicada - 2015

Fingerprint

Navegar pels temes de recerca de 'On the expected distance of a random walk'. Junts formen un fingerprint únic.

Com citar-ho