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 provide conditions that classify cover times for sequences of random walkson random graphs into two types: One type (Type 1) is the class of cover timesthat are of the order of the maximal hitting times scaled by the logarithm ofthe size of vertex sets. The other type (Type 2) is the class of cover timesthat are of the order of the maximal hitting times. The conditions aredescribed by some parameters determined by the underlying graphs: the volumes,the diameters with respect to the resistance metric, the coverings or packingsby balls in the resistance metric. We apply the conditions to and classify anumber of examples, such as supercritical Galton-Watson trees, the incipientinfinite cluster of a critical Galton-Watson tree and the Sierpinski gasketgraph.

Cover times for sequences of reversible Markov chains on random graphs