Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.00567 v4 pith:M5E22ICF submitted 2017-10-02 math.PR

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

classification math.PR
keywords randomtreesbranching-ruinnumberonce-reinforcedrecurrencetransiencewalk
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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, that we call the branching-ruin number of a tree, which provides (in the spirit of Furstenberg, 1970, and Lyons, 1990) 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.