Percolation on dense random graphs with given degrees
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914683869462528 |
|---|---|
| author | Lichev, Lyuben Mitsche, Dieter Perarnau, Guillem |
| author_facet | Lichev, Lyuben Mitsche, Dieter Perarnau, Guillem |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_02274 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Percolation on dense random graphs with given degrees Lichev, Lyuben Mitsche, Dieter Perarnau, Guillem Probability 05C80, 82B43 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. |
| title | Percolation on dense random graphs with given degrees |
| topic | Probability 05C80, 82B43 |
| url | https://arxiv.org/abs/2202.02274 |