Largest component of subcritical random graphs with given degree sequence

dc.contributor.author
Coulson, M.
dc.contributor.author
Perarnau, G.
dc.date.accessioned
2023-06-21T14:05:39Z
dc.date.accessioned
2024-09-19T14:25:22Z
dc.date.available
2023-06-21T14:05:39Z
dc.date.available
2024-09-19T14:25:22Z
dc.date.issued
2023-02-24
dc.identifier.uri
http://hdl.handle.net/2072/535461
dc.description.abstract
We study the size of the largest component of two models of random graphs with prescribed degree sequence, the configuration model (CM) and the uniform model (UM), in the (barely) subcritical regime. For the CM, we give upper bounds that are asymptotically tight for certain degree sequences. These bounds hold under mild conditions on the sequence and improve previous results of Hatami and Molloy on the barely subcritical regime. For the UM, we give weaker upper bounds that are tight up to logarithmic terms but require no assumptions on the degree sequence. In particular, the latter result applies to degree sequences with infinite variance in the subcritical regime. © 2023, Institute of Mathematical Statistics. All rights reserved.
eng
dc.description.sponsorship
Family Process Institute, FPI: MTM2017-82166-P, PRE2018-083621; Ministerio de Economía y Competitividad, MINECO; Agencia Estatal de Investigación, AEI: CEX2020-001084-M, PID2020-113082GB-I00. *M.C. was supported by the FPI grant PRE2018-083621 associated to the project MTM2017-82166-P from the Spanish Ministerio de Economía y Competitividad. G.P was supported by the Spanish Agencia Estatal de Investigación under projects MTM2017-82166-P and PID2020-113082GB-I00, and by the Severo Ochoa and María de Maeztu Program for Centers and Units of Excellence in R&D (CEX2020-001084-M).
dc.format.extent
28 p.
cat
dc.language.iso
eng
cat
dc.publisher
Institute of Mathematical Statistics
cat
dc.relation.ispartof
Electronic Journal of Probability
cat
dc.rights
L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons: https://creativecommons.org/licenses/by/4.0/
dc.source
RECERCAT (Dipòsit de la Recerca de Catalunya)
dc.subject.other
component struc-ture; configuration model; largest component; local limit theorems; random graph with given degree sequence
cat
dc.title
Largest component of subcritical random graphs with given degree sequence
cat
dc.type
info:eu-repo/semantics/article
cat
dc.type
info:eu-repo/semantics/publishedVersion
cat
dc.embargo.terms
cap
cat
dc.identifier.doi
10.1214/23-EJP921
cat
dc.rights.accessLevel
info:eu-repo/semantics/openAccess


Documents

LargestComponent.pdf

366.3Kb PDF

This item appears in the following Collection(s)

CRM Articles [719]