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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Rotor walk is deterministic counterpart of random walk on graphs. We studythat under a certain initial configuration in Z^d, n particles perform rotorwalks from the origin consecutively. They would stop if they hit the origin orinfinity. When the dimension d>=3, the escape rate exists and it attains theupper bound of O. Schramm. When the dimension d=2, the numbers of the particlesescaping to infinity are of order n/log(n). The limit of their quotient existand also attains the upper bound of L.Florescu,S.Ganguly,L.Levine,Y.Peres whichequals to frac{pi}{2}. We use the results and the methods of the outer estimatefor rotor-router aggregation in L.Levine and Y.Peres' previous paper.

A rotor configuration in Z^d where Schramm's bound of escape rates attains