English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We prove that Vertex Reinforced Random Walk on $\mathbb{Z}$ with weight  of order $k^\alpha$, with $\alpha\in [0,1/2)$, is either almost surely recurrent or almost surely transient.  This improves a previous result of Volkov who showed that the set of sites which are visited infinitely often was a.s. either empty or infinite.

A $0$-$1$ law for vertex-reinforced random walks on $\mathbb{Z}$ with weight of order $k^\alpha$, $\alpha\in[0,1/2)$