Class MocnikGenerator¶

Nested Relationships¶

Inheritance Relationships¶

Class Documentation¶

class MocnikGenerator : public NetworKit::StaticGraphGenerator¶

Public Functions

MocnikGenerator(count dim, count n, double k, bool weighted = false)¶

Creates random spatial graphs according to the Mocnik model.

Please cite the following publications, in which you will find a description of the model:

Franz-Benjamin Mocnik: “The Polynomial Volume Law of Complex Networks in

the Context of Local and Global Optimization”, Scientific Reports 8(11274)

1. doi: 10.1038/s41598-018-29131-0

Franz-Benjamin Mocnik, Andrew Frank: “Modelling Spatial Structures”, Proceedings of the 12th Conference on Spatial Information Theory (COSIT), 2015, pages 44-64. doi: 10.1007/978-3-319-23374-1_3

Improved algorithm.

Parameters:

• dim – Dimension of the space.

• n – Number of nodes in the graph; or a list containing the numbers of nodes in each layer in case of a hierarchical model.

• k – Density parameter, determining the ratio of edges to nodes; in case of a hierarchical model, also a list of density parameters can be provided.

• weighted – Determines whether weights should be added to the edges; in case of a hierarchical model, also a list of relative weights can be provided.

MocnikGenerator(count dim, std::vector<count> ns, double k, bool weighted = false)¶

MocnikGenerator(count dim, std::vector<count> ns, std::vector<double> ks, bool weighted = false)¶

MocnikGenerator(count dim, count n, double k, std::vector<double> weighted)¶

MocnikGenerator(count dim, std::vector<count> ns, double k, std::vector<double> weighted)¶

MocnikGenerator(count dim, std::vector<count> ns, std::vector<double> ks, std::vector<double> weighted)¶

virtual Graph generate() override¶