The Average Size of Giant Components Between the Double-Jump
| dc.creator | Ravelomanana, Vlady | |
| dc.creator | Collaboration, the Projet PAI Amadeus | |
| dc.date | 2006-07-12 | |
| dc.date.accessioned | 2026-07-07T07:16:19Z | |
| dc.date.available | 2026-07-07T07:16:19Z | |
| dc.description | We study the sizes of connected components according to their excesses during a random graph process built with $n$ vertices. The considered model is the continuous one defined in Janson 2000. An ${\ell}$-component is a connected component with ${\ell}$ edges more than vertices. $\ell$ is also called the \textit{excess} of such component. As our main result, we show that when $\ell$ and ${n \over \ell}$ are both large, the expected number of vertices that ever belong to an $\ell$-component is about ${12}^{1/3} {\ell}^{1/3} n^{2/3}$. We also obtain limit theorems for the number of creations of $\ell$-components. | |
| dc.description | A paraître dans Algorithmica | |
| dc.identifier | https://arxiv.org/abs/cs/0607057 | |
| dc.identifier | http://arxiv.org/abs/cs/0607057 | |
| dc.identifier | Algorithmica Issue spéciale "Analysis of Algorithms" (2006) A paraître | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/113549 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.subject | G.2.1; G.2.2; G.3 | |
| dc.title | The Average Size of Giant Components Between the Double-Jump | |
| dc.type | text |