tnetwork.generate_simple_random_graph

tnetwork.generate_simple_random_graph(nb_com=10, min_size=5, max_size=15, operations=20, mu=0, mu_noise=0.01)

Generate a simple random dynamic graph with community structure

This is the generator described in XXX. It generates a graph with dynamic community structure which is a combination of successive merge and splits.

Parameters:

• nb_com – number of initial communities
• min_size – size below which communities cannot be split
• max_size – size above which community split
• operations – number of operations (merge/split) to execute (involves random communities)
• mu – parameter to set how well defined is the community structure (0=>perfect community structure) more precisely, it defines: alpha=1-mu, beta=mu
• mu_noise – set the mu_r, i.e., fraction of edges randomly rewired at each snapshot

Returns:

pair (graph, communities)