{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:06:04Z","timestamp":1773241564700,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The graph obtained from the integer grid $\\mathbb{Z}\\times\\mathbb{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\u00e1ki, Cs\u00f6rg\u0151, F\u00f6ldes, R\u00e9v\u00e9sz, and Tusn\u00e1dy by showing that the expected number of vertices visited by a random walk on the comb after $n$ steps is $(\\frac1{2\\sqrt{2\\pi}}+o(1))\\sqrt{n}\\log n.$ This contradicts a claim of Weiss and Havlin.<\/jats:p>","DOI":"10.37236\/3571","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:21:27Z","timestamp":1578705687000},"source":"Crossref","is-referenced-by-count":1,"title":["The Range of a Random Walk on a Comb"],"prefix":"10.37236","volume":"20","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[]},{"given":"G\u00e1bor","family":"Tardos","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,10,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i3p59\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i3p59\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:12:17Z","timestamp":1579259537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i3p59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,7]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,7,19]]}},"URL":"https:\/\/doi.org\/10.37236\/3571","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,7]]},"article-number":"P59"}}