dc.contributor.author
Lichev, L.
dc.contributor.author
Mitsche, D.
dc.contributor.author
Perarnau, G.
dc.date.accessioned
2024-05-06T10:35:43Z
dc.date.accessioned
2024-09-19T14:26:37Z
dc.date.available
2024-05-06T10:35:43Z
dc.date.available
2024-09-19T14:26:37Z
dc.date.issued
2024-07-01
dc.identifier.uri
http://hdl.handle.net/2072/537567
dc.description.abstract
In this paper, we study the order of the largest connected component of a random graph having two sources of randomness: first, the graph is chosen randomly from all graphs with a given degree sequence, and then bond percolation is applied. Far from being able to classify all such degree sequences, we exhibit several new threshold phenomena for the order of the largest component in terms of both sources of randomness. We also provide an example of a degree sequence for which the order of the largest component undergoes an unbounded number of jumps in terms of the percolation parameter, giving rise to a behavior that cannot be observed without percolation. © 2024 Elsevier Inc.
eng
dc.description.sponsorship
DM has been supported by FONDECYT grant 1220174 and by GrHyDy ANR-20-CE40-0002.GP was supported by MICIU/AEI/10.13039/501100011033 under projects PID2020-113082GB-I00, RED2022-134947-T and the Severo Ochoa and María de Maeztu Program for Centres and Units of Excellence in R&D (CEX2020-001084-M).
dc.format.extent
25 p.
cat
dc.publisher
Academic Press Inc.
cat
dc.relation.ispartof
Journal of Combinatorial Theory. Series B
cat
dc.source
RECERCAT (Dipòsit de la Recerca de Catalunya)
dc.subject.other
Degree sequence; Giant component; Percolation; Switching method; Threshold
cat
dc.title
Percolation on dense random graphs with given degrees
cat
dc.type
info:eu-repo/semantics/article
cat
dc.type
info:eu-repo/semantics/acceptedVersion
cat
dc.identifier.doi
10.1016/j.jctb.2024.03.002
cat
dc.rights.accessLevel
info:eu-repo/semantics/openAccess
