The branching-ruin number and the critical parameter of once-reinforced random walk on trees

Andrea Collevecchio, Daniel Kious, Vladas Sidoravicius

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The motivation for this paper is the study of the phase transition for recurrence/ transience of a class of self‐interacting random walks on trees, which includes the once‐reinforced random walk. For this purpose, we define a quantity, which we call the branching‐ruin number of a tree, which provides (in the spirit of Furstenberg [11] and Lyons [13]) a natural way to measure trees with polynomial growth. We prove that the branching‐ruin number of a tree is equal to the critical parameter for the recurrence/transience of the once‐reinforced random walk. We define a sharp and effective (i.e., computable) criterion characterizing the recurrence/transience of a larger class of self‐interacting walks on trees, providing the complete picture for their phase transition.
Original languageEnglish
Pages (from-to)210-236
Number of pages27
JournalCommunications on Pure and Applied Mathematics
Volume73
Issue number1
Early online date12 Nov 2019
DOIs
Publication statusPublished - 1 Jan 2020

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

The branching-ruin number and the critical parameter of once-reinforced random walk on trees. / Collevecchio, Andrea; Kious, Daniel; Sidoravicius, Vladas.

In: Communications on Pure and Applied Mathematics, Vol. 73, No. 1, 01.01.2020, p. 210-236.

Research output: Contribution to journalArticle

@article{83ffcc62108c4c589ea3ce58160cba68,
title = "The branching-ruin number and the critical parameter of once-reinforced random walk on trees",
abstract = "The motivation for this paper is the study of the phase transition for recurrence/ transience of a class of self‐interacting random walks on trees, which includes the once‐reinforced random walk. For this purpose, we define a quantity, which we call the branching‐ruin number of a tree, which provides (in the spirit of Furstenberg [11] and Lyons [13]) a natural way to measure trees with polynomial growth. We prove that the branching‐ruin number of a tree is equal to the critical parameter for the recurrence/transience of the once‐reinforced random walk. We define a sharp and effective (i.e., computable) criterion characterizing the recurrence/transience of a larger class of self‐interacting walks on trees, providing the complete picture for their phase transition.",
author = "Andrea Collevecchio and Daniel Kious and Vladas Sidoravicius",
year = "2020",
month = "1",
day = "1",
doi = "10.1002/cpa.21860",
language = "English",
volume = "73",
pages = "210--236",
journal = "Communications on Pure and Applied Mathematics",
issn = "0010-3640",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - The branching-ruin number and the critical parameter of once-reinforced random walk on trees

AU - Collevecchio, Andrea

AU - Kious, Daniel

AU - Sidoravicius, Vladas

PY - 2020/1/1

Y1 - 2020/1/1

N2 - The motivation for this paper is the study of the phase transition for recurrence/ transience of a class of self‐interacting random walks on trees, which includes the once‐reinforced random walk. For this purpose, we define a quantity, which we call the branching‐ruin number of a tree, which provides (in the spirit of Furstenberg [11] and Lyons [13]) a natural way to measure trees with polynomial growth. We prove that the branching‐ruin number of a tree is equal to the critical parameter for the recurrence/transience of the once‐reinforced random walk. We define a sharp and effective (i.e., computable) criterion characterizing the recurrence/transience of a larger class of self‐interacting walks on trees, providing the complete picture for their phase transition.

AB - The motivation for this paper is the study of the phase transition for recurrence/ transience of a class of self‐interacting random walks on trees, which includes the once‐reinforced random walk. For this purpose, we define a quantity, which we call the branching‐ruin number of a tree, which provides (in the spirit of Furstenberg [11] and Lyons [13]) a natural way to measure trees with polynomial growth. We prove that the branching‐ruin number of a tree is equal to the critical parameter for the recurrence/transience of the once‐reinforced random walk. We define a sharp and effective (i.e., computable) criterion characterizing the recurrence/transience of a larger class of self‐interacting walks on trees, providing the complete picture for their phase transition.

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

U2 - 10.1002/cpa.21860

DO - 10.1002/cpa.21860

M3 - Article

VL - 73

SP - 210

EP - 236

JO - Communications on Pure and Applied Mathematics

JF - Communications on Pure and Applied Mathematics

SN - 0010-3640

IS - 1

ER -