Critical window for the configuration model: finite third moment degrees
From MaRDI portal
Publication:513066
DOI10.1214/17-EJP29zbMath1387.60016arXiv1605.02868OpenAlexW2368719211MaRDI QIDQ513066
Johan S. H. van Leeuwaarden, Sanchayan Sen, Remco van der Hofstad, Souvik Dhara
Publication date: 3 March 2017
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.02868
universalitymultiplicative coalescentscaling windowBrownian excursions with parabolic driftcritical configuration modelfinite third moment degree
Related Items
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, Mesoscopic scales in hierarchical configuration models, Depth first exploration of a configuration model, Critical percolation on scale-free random graphs: new universality class for the configuration model, Universality for critical heavy-tailed network models: metric structure of maximal components, A probabilistic approach to the leader problem in random graphs, The probability of unusually large components for critical percolation on random \(d\)-regular graphs, Stable graphs: distributions and line-breaking construction, Largest component of subcritical random graphs with given degree sequence, Unnamed Item, Unnamed Item, Scaling Limits of Random Trees and Random Graphs, Big Jobs Arrive Early: From Critical Queues to Random Graphs, Heavy-tailed configuration models at criticality, Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Preferential attachment without vertex growth: emergence of the giant component, Critical random graphs and the differential equations technique, Critical random forests, Finite-pool queueing with heavy-tailed services, 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, Component structure of the configuration model: Barely supercritical case, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
