Computational Model Library

Displaying 10 of 132 results #Networks clear search

Importing a Roman transport network

Tom Brughmans | Published Sunday, September 30, 2018

A draft model teaching how a Roman transport model can be imported into Netlogo, and the issues confronted when importing and reusing open access Roman datasets. This model is used for the tutorial:
Brughmans, T. (2018). Importing a Roman Transport network with Netlogo, Tutorial, https://archaeologicalnetworks.wordpress.com/resources/#transport .

Network structures tutorial

Tom Brughmans | Published Sunday, September 30, 2018 | Last modified Tuesday, October 02, 2018

A draft model with some useful code for creating different network structures using the Netlogo NW extension. 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 .

Peer reviewed Ants Digging Networks

Elske van der Vaart | Published Friday, September 14, 2018

This is a NetLogo version of Buhl et al.’s (2005) model of self-organised digging activity in ant colonies. It was built for a master’s course on self-organisation and its intended use is still educational. The ants’ behavior can easily be changed by toggling switches on the interface, or, for more advanced students, there is R code included allowing the model to be run and analysed through RNetLogo.

MERCURY extension: transport-cost

Tom Brughmans | Published Monday, July 23, 2018

This is extended version of the MERCRUY model (Brughmans 2015) incorporates a ‘transport-cost’ variable, and is otherwise unchanged. This extended model is described in this publication: Brughmans, T., 2019. Evaluating the potential of computational modelling for informing debates on Roman economic integration, in: Verboven, K., Poblome, J. (Eds.), Structural Determinants in the Roman World.

Brughmans, T., 2015. MERCURY: an ABM of tableware trade in the Roman East. CoMSES Comput. Model Libr. URL https://www.comses.net/codebases/4347/releases/1.1.0/

The model formalizes a situation where agents embedded in different types of networks (random, small world and scale free networks) interact with their neighbors and express an opinion that is the result of different mechanisms: a coherence mechanism, in which agents try to stick to their previously expressed opinions; an assessment mechanism, in which agents consider available external information on the topic; and a social influence mechanism, in which agents tend to approach their neighbor’s opinions.

A dynamic model of social network formation on single-layer and multiplex networks with structural incentives that vary over time.

ACT: Agent-based model of Critical Transitions

Igor Nikolic Oscar Kraan Steven Dalderop Gert Jan Kramer | Published Wednesday, October 18, 2017 | Last modified Monday, August 27, 2018

ACT is an ABM based on an existing conceptualisation of the concept of critical transitions applied to the energy transition. With the model we departed from the mean-field approach simulated relevant actor behaviour in the energy transition.

The model employs an agent-based model for exploring the victim-centered approach to identifying human trafficking and the approach’s effectiveness in an abstract representation of migrant flows.

The model presented here was created as part of my dissertation. It aims to study the impacts of topography and climate change on prehistoric networks, with a focus on the Magdalenian, which is dated to between 20 and 14,000 years ago.

This code simulates the WiFi user tracking system described in: Thron et al., “Design and Simulation of Sensor Networks for Tracking Wifi Users in Outdoor Urban Environments”. Testbenches used to create the figures in the paper are included.

Displaying 10 of 132 results #Networks clear search

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept