Component sizes for large quantum Erdős-Rényi graph near criticality

DOI10.1214/17-AOP1209zbMath1410.05180arXiv1404.5705MaRDI QIDQ2414155

Sreekar Vadlamani, Amir Dembo, Anna Levit

Publication date: 10 May 2019

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5705

zbMATH Keywords

weak convergencecritical pointBrownian excursionsscaling limitsquantum random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Quantum equilibrium statistical mechanics (general) (82B10) Functional limit theorems; invariance principles (60F17)

Related Items (5)

Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems ⋮ On breadth‐first constructions of scaling limits of random graphs and random unicellular maps ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ The probability of unusually large components in the near-critical Erdős–Rényi graph

This page was built for publication: Component sizes for large quantum Erdős-Rényi graph near criticality