2 research outputs found
On the growth of components with non fixed excesses
A small note on the evolution of giant componentsInternational audienceDenote by an -component a connected graph with edges more than vertices. We prove that the expected number of creations of -component, by means of adding a new edge to an -component in a randomly growing graph with vertices, tends to as tends to but with . We also show, under the same conditions on and , that the expected number of vertices that ever belong to an -component is