duplication_divergence_graph(n, p, seed=None)¶
Returns an undirected graph using the duplication-divergence model.
A graph of
nnodes is created by duplicating the initial nodes and retaining edges incident to the original nodes with a retention probability
- n (int) – The desired number of nodes in the graph.
- p (float) – The probability for retaining the edge of the replicated node.
- seed (integer, random_state, or None (default)) – Indicator of random number generation state. See Randomness.
Return type: Raises:
pis not a valid probability. If
nis less than 2.
This algorithm appears in .
This implementation disallows the possibility of generating disconnected graphs.
 I. Ispolatov, P. L. Krapivsky, A. Yuryev, “Duplication-divergence model of protein interaction network”, Phys. Rev. E, 71, 061911, 2005.