networkx.algorithms.smallworld.lattice_reference

lattice_reference(G, niter=1, D=None, connectivity=True, seed=None)[source]

Latticize the given graph by swapping edges.

Parameters
Ggraph

An undirected graph with 4 or more nodes.

niterinteger (optional, default=1)

An edge is rewired approximatively niter times.

Dnumpy.array (optional, default=None)

Distance to the diagonal matrix.

connectivityboolean (optional, default=True)

Ensure connectivity for the latticized graph when set to True.

seedinteger, random_state, or None (default)

Indicator of random number generation state. See Randomness.

Returns
Ggraph

The latticized graph.

Notes

The implementation is adapted from the algorithm by Sporns et al. [1]. which is inspired from the original work by Maslov and Sneppen(2002) [2].

References

1

Sporns, Olaf, and Jonathan D. Zwi. “The small world of the cerebral cortex.” Neuroinformatics 2.2 (2004): 145-162.

2

Maslov, Sergei, and Kim Sneppen. “Specificity and stability in topology of protein networks.” Science 296.5569 (2002): 910-913.