REAL

The Range of a Random Walk on a Comb

Pach, János and Tardos, Gábor (2013) The Range of a Random Walk on a Comb. ELECTRONIC JOURNAL OF COMBINATORICS, 20 (3). ISSN 1077-8926

[img]
Preview
Text
1309.6360.pdf

Download (118kB) | Preview

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 Csaki, Csorgo, Foldes, Revesz, and Tusnady by showing that the expected number of vertices visited by a random walk on the comb after n steps is (1/2 root 2 pi + o(1)) root n log n. This contradicts a claim of Weiss and Havlin.

Item Type: Article
Additional Information: : SCIENCES, NEWARK, DE 19716 USA
Uncontrolled Keywords: GRAPHS; RECURRENT; 2-dimensional comb; Random walk
Subjects: Q Science / természettudomány > QA Mathematics / matematika
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 06 Feb 2014 15:33
Last Modified: 06 Feb 2014 15:33
URI: http://real.mtak.hu/id/eprint/10038

Actions (login required)

Edit Item Edit Item