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

Consider a critical Erdos-Renyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{−1}$ + $\lambda n^{−4/3}$ , $\lambda$ being a fixed real number. When $n$ goes to infinity, Addario-Berry, Broutin and Goldschmidt have shown that the collection of connected components, viewed as suitably normalized measured compact metric spaces, converges in distribution to a continuous limit $G_\lambda$ made of random real graphs. In this paper, we consider notably the dynamical percolation on critical Erdos-Renyi random graphs. To each pair of vertices is attached a Poisson process of intensity $n^{−1/3}$, and every time it rings, one resamples the corresponding edge. Under this process, the collection of connected components undergoes coalescence and fragmentation. We prove that this process converges in distribution, as $n$ goes to infinity, towards a fragmentation-coalescence process on the continuous limit $G_\lambda$. We also prove convergence of discrete coalescence and fragmentation processes and provide Feller-type properties associated to fragmentation and coalescence.

Scaling limit of dynamical percolation on critical Erdős–Rényi random graphs