A draft model with some useful code for creating different network structures using the Netlogo NW extension: small-world, preferential attachment, circular, star, wheel, lattice, random, nearest neighbours.
A draft model with some useful code for creating different network structures using the Netlogo NW extension: small-world, preferential attachment, circular, star, wheel, lattice, random, nearest neighbours. This model is used for the following tutorial: Brughmans, T. (2018). Network structures and assembling code in NetLogo, Tutorial, https://archaeologicalnetworks.wordpress.com/resources/#structures .
By Tom Brughmans
First version: Summer 2018
This version created 01/09/2018
Netlogo version used: 6.0.1
Extension used: nw (pre-packaged with Netlogo 6.0.1)
https://ccl.northwestern.edu/netlogo/6.0-BETA1/docs/nw.html
Tutorial document available as a PDF in the netlogo_implementation folder
Cite this tutorial as:
Brughmans, T. (2018). Network structures and assembling code in Netlogo, Tutorial, https://archaeologicalnetworks.wordpress.com/resources/#structures .
This tutorial provides an introduction to finding and assembling pre-existing code to quickly create complex models. It uses code and data linked to in the https://projectmercury.eu pages. We will create a Roman transport network by reusing existing code that draws on the open access ORBIS dataset (http://orbis.stanford.edu/), we will create alternative network structures by reusing existing code, and we will explore the impact these different network structures have in light of simple economic processes. This tutorial will reveal the importance of not reinventing the wheel, of searching for appropriate existing code and letting your model building be inspired by others’ previous work.
See full list of documentation resources in documentation.
| Name | Type | Description |
|---|---|---|
| new-network-structure | string | The type of network structure you want to create, either small-world, preferential attachment, circular, star, wheel, lattice, random, nearest neighbours |
| nodes | integer | The number of nodes in the network that will be created. |
| probability | float | Value between 0 and 1, the probability with which a link will be created in the small-world and random network structures. |
| nearest-neighbours | integer | The number of nearest nodes that a node will be connected to in the "nearest neighbours" network structure |
| existing-network-structure | string | When keeping the nodes but creating new links between them (same-nodes/new-links), the type of network structure you will follow to create those links. Either nearest neighbour, random, star, circular. |
| Name | Type | Description |
|---|---|---|
| Network topology | network | The set of nodes and links created using the network creation algorithm selected. |
| average-degree | float | the average number of links a node has |
| clustering-coefficient | float | the proportion of closed triangles over all triads in the network; the degree of local clustering in the network. |
| Av. shortest path length | float | the mean path length in the network; the mean number of steps to connect one node with another node |
| degree distribution | frequency distribution | The frequency distribution of the number of links a node has (its degree) |
Use open Roman datasets via and import them into a NetLogo model, using the ORBIS dataset (http://orbis.stanford.edu/) to create a set of Roman settlements and major routes between them.