Pith. sign in

REVIEW 1 cited by

On the speed of distance stationary sequences

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 1912.12523 v1 pith:DVLJCRLX submitted 2019-12-28 math.PR

classification math.PR
keywords randomspeedstationaryapplicationsdistanceformulasequenceswalks
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We prove a formula for the speed of distance stationary random sequences generalizing the law of large numbers of Karlsson and Ledrappier. A particular case is the classical formula for the largest Lyapunov exponent of i.i.d.\ matrix products, but our result has applications in various different contexts. In many situations it gives a method to estimate the speed, and in others it allows to obtain results of dimension drop for escape measures related to random walks. We show applications to stationary reversible random trees with conductances, Bernoulli bond percolation of Cayley graphs, and random walks on cocompact Fuchsian groups.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Entropy and dimension of disintegrations of stationary measures

    math.DS 2019-08 conditional novelty 7.0 of 10

    For stationary measures on the flags of R^d, the conditional measures along each one-dimensional flag foliation are exact dimensional with dimension equal to an entropy divided by the Lyapunov gap.

Pith tools