Graph_generator module

Graph generation.

simplicial_kuramoto.graph_generator.modular_graph(Nc, Nn, Nie, rando=True, inter_weight=0.5, intra_weight=0.5)

Creates a modular network.

The network is constructed with Nc clique modules of size Nn and all connected by Nie edges, in a linear way.

Parameters:

• Nc – number of modules

• Nn – number of nodes per module

• Nie – number of edges between modules (added linearly), has to be smaller than Nn(Nn-1)/2

simplicial_kuramoto.graph_generator.ring_of_rings(num_rings, ring_size)

Create ring of rings network.

simplicial_kuramoto.graph_generator.delaunay_with_holes(n_points=None, centres=None, radii=None, n_nodes_hole=20, points=None)

Create a delanay mesh with holes, if centres=None, no holes will be created.

simplicial_kuramoto.graph_generator.make_simple(plot=False, larger=False)

Make simple simplicial complex with one face and one hole.

simplicial_kuramoto.graph_generator.make_complete(n=5, plot=False)

Make a complete graph.