Pith. sign in

REVIEW

Functional central limit theorem for random walks in random environment defined on regular 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 1910.09128 v2 pith:K22CDYS5 submitted 2019-10-21 math.PR

Functional central limit theorem for random walks in random environment defined on regular trees

classification math.PR
keywords randomdefinedenvironmentlevelsproveregulartheoremtrees
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study Random Walks in an i.i.d. Random Environment (RWRE) defined on $b$-regular trees. We prove a functional central limit theorem (FCLT) for transient processes, under a moment condition on the environment. We emphasize that we make no uniform ellipticity assumptions. Our approach relies on regenerative levels, i.e. levels that are visited exactly once. On the way, we prove that the distance between consecutive regenerative levels have a geometrically decaying tail. In the second part of this paper, we apply our results to Linearly Edge-Reinforced Random Walk (LERRW) to prove FCLT when the process is defined on $b$-regular trees, with $ b \ge 4$, substantially improving the results of the first author (see Theorem 3 of Collevecchio (2006)).

discussion (0)

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