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 study limits of the largest connected components (viewed as metric spaces)obtained by critical percolation on uniformly chosen graphs and configurationmodels with heavy-tailed degrees. For rank-one inhomogeneous random graphs,such results were derived by Bhamidi, van der Hofstad, Sen [Probab. TheoryRelat. Fields 2018]. We develop general principles under which the identicalscaling limits as the rank-one case can be obtained. Of independent interest,we derive refined asymptotics for various susceptibility functions and themaximal diameter in the barely subcritical regime.

Universality for critical heavy-tailed network models: Metric structure of maximal components