duplication_divergence_graph(n, p, seed=None)
A graph of n nodes is created by duplicating the initial nodes and retaining edges incident to the original nodes with a retention probability p.
This algorithm appears in [1].
This implementation disallows the possibility of generating disconnected graphs.
The desired number of nodes in the graph.
The probability for retaining the edge of the replicated node.
Indicator of random number generation state. See Randomness<randomness>
.
Returns an undirected graph using the duplication-divergence model.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them