Tail distributions of cover times of once-reinforced random walks
Abstract
We consider the tail distribution of the edge cover time of a specific non-Markov process, δ once-reinforced random walk, on finite connected graphs, whose transition probability is proportional to weights of edges. Here the weights are 1 on edges not traversed and δ∈(0,∞) otherwise. In detail, we show that its tail distribution decays exponentially, and obtain a phase transition of the exponential integrability of the edge cover time with critical exponent αc1(δ), which has a variational representation and some interesting analytic properties including αc1(0+) reflecting the graph structures.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.