Graphical Evolution: An Introduction to the Theory of Random Graphs, 1985. Edgar M. Palmer.
Random Graphs. 1985. Bela Bollobas.

For Belen:

	Nodes	Edges	Giant Component, its Expected Value* and Ratio in a random graph	Giant bicomponent in a random graph
Kinship	532	567	457 (441.6) 1.03	174 (.923)** (220 edges)
Compadrazgo	142	397	119*** (141.5) .84	88 (.997)** (247 edges)

Mathematica formulae : * giant [n_,e_] := N[n*(1-(Sum [((k^(k-1))/k!)*((2*e/n)*E^-(2*e/n))^k,{k,1,40}]/(2*e/n)))]

**hamiltonian [n_,e_]:=N[E^-E^-(2*e/n)]

***All other components are singletons except for a pair

Table 5: Kinship and Compadrazgo: Giant Components