Random walk on a polygon
| dc.creator | Sarkar, Jyotirmoy | |
| dc.date | 2006-11-22 | |
| dc.date.accessioned | 2026-07-07T08:08:25Z | |
| dc.date.available | 2026-07-07T08:08:25Z | |
| dc.description | A particle moves among the vertices of an $(m+1)$-gon which are labeled clockwise as $0,1,...,m$. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability $p$, or counterclockwise with probability $1-p$. The directions of successive movements are independent. What is the expected number of moves needed to visit all vertices? This and other related questions are answered using recursive relations. | |
| dc.description | Published at http://dx.doi.org/10.1214/074921706000000581 in the IMS Lecture Notes--Monograph Series (http://www.imstat.org/publications/lecnotes.htm) by the Institute of Mathematical Statistics (http://www.imstat.org) | |
| dc.identifier | https://arxiv.org/abs/math/0611676 | |
| dc.identifier | http://arxiv.org/abs/math/0611676 | |
| dc.identifier | IMS Lecture Notes--Monograph Series 2006, Vol. 50, 31-43 | |
| dc.identifier | doi:10.1214/074921706000000581 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131256 | |
| dc.subject | Probability | |
| dc.subject | Statistics Theory | |
| dc.subject | 60G50 (Primary) 60G40 (Secondary) | |
| dc.title | Random walk on a polygon | |
| dc.type | text |