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

We prove a bound on the effective resistance   R   (   x  ,  y   )    between two vertices   x  ,  y   of a connected graph which contains a suitably well‐connected subgraph. We apply this bound to the Erdős‐Rényi random graph   G   (   n  ,  p   )    with    n  p  =  Ω   (   log     n   )    , proving that   R   (   x  ,  y   )    concentrates around    1  /  d   (  x  )   +  1  /  d   (  y  )    , that is, the sum of reciprocal degrees. We also prove expectation and concentration results for the random walk hitting times, Kirchoff index, cover cost, and the random target time (Kemeny's constant) on   G   (   n  ,  p   )    in the sparsely connected regime    log     n  +  log  log     log     n  ≤  n  p  <   n   1  /  10.

Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs