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

The largest components of the critical Erd\H{o}s-R\'enyi graph, $G(n,p)$ with$p=1/n$, have size of order $n^{2/3}$ with high probability. We give detailedasymptotics for the probability that there is an unusually large component,i.e. of size $an^{2/3}$ for large $a$. Our results, which extend work ofPittel, allow $a$ to depend upon $n$ and also hold for a range of values of $p$around $1/n$. We also provide asymptotics for the distribution of the size ofthe component containing a particular vertex.

The probability of unusually large components in the near-critical Erd\H{o}s-R\'enyi graph