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 study graph‐theoretic properties of the trace of a random walk on a random graph. We show that for any    ε  >  0    there exists    C  >  1    such that the trace of the simple random walk of length    (  1  +  ε  )  n  ln  n    on the random graph    G  ∼  G  (  n  ,  p  )    for    p  >  C  ln  n  /  n    is, with high probability, Hamiltonian and    Θ  (  ln  n  )   ‐connected. In the special case    p  =  1    (that is, when    G  =   K  n    ), we show a hitting time result according to which, with high probability, exactly one step after the last vertex has been visited, the trace becomes Hamiltonian, and one step after the last vertex has been visited for the   k  'th time, the trace becomes    2  k   ‐connected.

On the trace of random walks on random graphs