The range of a random walk on a comb

János Pach, G. Tardos

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The graph obtained from the integer grid ℤ×ℤ 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örgo{double acute}, 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. This contradicts a claim of Weiss and Havlin.

Original languageEnglish
JournalElectronic Journal of Combinatorics
Volume20
Issue number3
Publication statusPublished - Oct 7 2013

Fingerprint

Random walk
Graph in graph theory
Acute
Range of data
Horizontal
Denote
Grid
Integer
Vertex of a graph

Keywords

  • Random walk

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

The range of a random walk on a comb. / Pach, János; Tardos, G.

In: Electronic Journal of Combinatorics, Vol. 20, No. 3, 07.10.2013.

Research output: Contribution to journalArticle

@article{311eef8d62224011b2efc113fe463b22,
title = "The range of a random walk on a comb",
abstract = "The graph obtained from the integer grid ℤ×ℤ 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{\'a}ki, Cs{\"o}rgo{double acute}, F{\"o}ldes, R{\'e}v{\'e}sz, and Tusn{\'a}dy by showing that the expected number of vertices visited by a random walk on the comb after n steps is. This contradicts a claim of Weiss and Havlin.",
keywords = "Random walk",
author = "J{\'a}nos Pach and G. Tardos",
year = "2013",
month = "10",
day = "7",
language = "English",
volume = "20",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "3",

}

TY - JOUR

T1 - The range of a random walk on a comb

AU - Pach, János

AU - Tardos, G.

PY - 2013/10/7

Y1 - 2013/10/7

N2 - The graph obtained from the integer grid ℤ×ℤ 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örgo{double acute}, 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. This contradicts a claim of Weiss and Havlin.

AB - The graph obtained from the integer grid ℤ×ℤ 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örgo{double acute}, 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. This contradicts a claim of Weiss and Havlin.

KW - Random walk

UR - http://www.scopus.com/inward/record.url?scp=84885463452&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885463452&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84885463452

VL - 20

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 3

ER -