relaxed_caveman_graph(l, k, p, seed=None)¶
Returns a relaxed caveman graph.
A relaxed caveman graph starts with
lcliques of size
k. Edges are then randomly rewired with probability
pto link different cliques.
l (int) – Number of groups
k (int) – Size of cliques
p (float) – Probabilty of rewiring each edge.
seed (integer, random_state, or None (default)) – Indicator of random number generation state. See Randomness.
G – Relaxed Caveman Graph
- Return type
NetworkXError – If p is not in [0,1]
>>> G = nx.relaxed_caveman_graph(2, 3, 0.1, seed=42)
Santo Fortunato, Community Detection in Graphs, Physics Reports Volume 486, Issues 3-5, February 2010, Pages 75-174. https://arxiv.org/abs/0906.0612