Critical Connections

email to discuss
realistic networks

To conduct simulation based experiments about networks, algorithms are necessary that can generate networks with characteristics that are able to be systematically varied over real-world ranges. There are many published algorithms that can generate networks with specific values of one or two structural properties. I am interested in developing algorithms able to simultaneously control three properties, initially focussing on degree distribution, clustering and assortativity.

There are also published algorithms that generate networks with general features such as a community structure. Some of these algorithms have several input parameters to control these features, but it is not clear how the features relate to the specific properties in which I am interested. For these algorithms, I am identifying relationships between the input parameters and the properties of the generated networks.


Badham, J. M. & Stocker, R. 2010, 'A spatial approach to network generation for three properties: Degree distribution, clustering coefficient and degree assortativity', Journal of Artificial Societies and Social Simulation, vol. 13, no. 1, (article 11).

Badham, J. M., Abbass, H. A. & Stocker, R. 2008, 'Parameterisation of Keeling's network generation algorithm', Theoretical Population Biology, vol. 74, no. 2, pp. 161-166.