Back to Search
Start Over
The range of a random walk on a comb
- Publication Year :
- 2013
- Publisher :
- arXiv, 2013.
-
Abstract
- The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of the neighbors of v, each with probability 1/d(v), where d(v) denotes the degree of v. We answer a question of Cs��ki, Cs��rg��, F��ldes, R��v��sz, and Tusn��dy by showing that the expected number of vertices visited by a random walk on the comb after n steps is (1/(2\sqrt{2��})+o(1))\sqrt n\log n. This contradicts a claim of Weiss and Havlin.<br />8 pages
- Subjects :
- 05C81
Probability (math.PR)
FOS: Mathematics
Subjects
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi...........24737e24ed71e4f3c3b0d458ee0047b8
- Full Text :
- https://doi.org/10.48550/arxiv.1309.6360