omega(G, niter=5, nrand=10, seed=None)
The small-world coefficient of a graph G is:
omega = Lr/L - C/Cl
where C and L are respectively the average clustering coefficient and average shortest path length of G. Lr is the average shortest path length of an equivalent random graph and Cl is the average clustering coefficient of an equivalent lattice graph.
The small-world coefficient (omega) measures how much G is like a lattice or a random graph. Negative values mean G is similar to a lattice whereas positive values mean G is a random graph. Values close to 0 mean that G has small-world characteristics.
The implementation is adapted from the algorithm by Telesford et al. .
An undirected graph.
Approximate number of rewiring per edge to compute the equivalent random graph.
Number of random graphs generated to compute the maximal clustering coefficient (Cr) and average shortest path length (Lr).
Indicator of random number generation state. See Randomness<randomness>
.
The small-world coefficient (omega)
Returns the small-world coefficient (omega) of a graph
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