On the growth of components with non fixed excesses
| dc.creator | Baert, Anne-Elisabeth | |
| dc.creator | Ravelomanana, Vlady | |
| dc.creator | Thimonier, Loÿs | |
| dc.date | 2007-06-12 | |
| dc.date.accessioned | 2026-07-07T08:09:44Z | |
| dc.date.available | 2026-07-07T08:09:44Z | |
| dc.description | Denote by an $l$-component a connected graph with $l$ edges more than vertices. We prove that the expected number of creations of $(l+1)$-component, by means of adding a new edge to an $l$-component in a randomly growing graph with $n$ vertices, tends to 1 as $l,n$ tends to $\infty$ but with $l = o(n^{1/4})$. We also show, under the same conditions on $l$ and $n$, that the expected number of vertices that ever belong to an $l$-component is $\sim (12l)^{1/3} n^{2/3}$. | |
| dc.description | A small note on the evolution of giant components | |
| dc.identifier | https://arxiv.org/abs/0706.1642 | |
| dc.identifier | http://arxiv.org/abs/0706.1642 | |
| dc.identifier | Discrete Applied Mathematics 130, 3 (17/07/2003) 487--493 | |
| dc.identifier | doi:10.1016/S0166-218X(03)00326-3 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131623 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Combinatorics | |
| dc.subject | G.2.2; G.3 | |
| dc.title | On the growth of components with non fixed excesses | |
| dc.type | text |