Computational Model Library

Displaying 10 of 190 results network clear search

The model simulates seven agents engaging in collective action and inter-network social learning. The objective of the model is to demonstrate how mental models of agents can co-evolve through a complex relationship among factors influencing decision-making, such as access to knowledge and personal- and group-level constraints.

LaMEStModel

Ruth Meyer | Published Friday, October 12, 2018

The Labour Markets and Ethnic Segmentation (LaMESt) Model is a model of a simplified labour market, where only jobs of the lowest skill level are considered. Immigrants of two different ethnicities (“Latino”, “Asian”) compete with a majority (“White”) and minority (“Black”) native population for these jobs. The model’s purpose is to investigate the effect of ethnically homogeneous social networks on the emergence of ethnic segmentation in such a labour market. It is inspired by Waldinger & Lichter’s study of immigration and the social organisation of labour in 1990’s Los Angeles.

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 .

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 .

Project for the course “Introduction to Agent-Based Modeling”.

The NetLogo model implements an Opinion Dynamics model with different confidence distributions, inspired by the Bounded Confidence model presented by Hegselmann and Krause in 2002. Hegselmann and Krause used a model with uniform distribution of confidence, but one could imagine agents that are more confident in their own opinions than others. Confidence with triangular, semi-circular, and Gaussian distributions are implemented. Moreover, network structure is optional and can be taken into account in the agent’s confidence such that agents assign less confidence the further away from them other agents are.

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/

In the consumer advice network, users with connections can interact with each other, and the network topology will change during the opinion interaction. When the opinion distance from i to j is greater than the confidence threshold, the two consumers cannot exchange opinions, and the link between them will disconnect with probability DE. Then, a link from node i to node k is established with probability CE and node i learning opinion from node k.

PercolationPrice

Paolo Zeppini Koen Frenken Luis Izquierdo | Published Thursday, December 21, 2017 | Last modified Thursday, May 03, 2018

This model simulate product diffusion on different social network structures.

We expose RA agent-based model of the opinion and tolerance dynamics in artificial societies. The formal mathematical model is based on the ideas of Social Influence, Social Judgment, and Social Identity theories.

Displaying 10 of 190 results network 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