Computational Model Library

Our mission is to help computational modelers develop, document, and share their computational models in accordance with community standards and good open science and software engineering practices. Model authors can publish their model source code in the Computational Model Library with narrative documentation as well as metadata that supports open science and emerging norms that facilitate software citation, computational reproducibility / frictionless reuse, and interoperability. Model authors can also request private peer review of their computational models. Models that pass peer review receive a DOI once published.

All users of models published in the library must cite model authors when they use and benefit from their code.

Please check out our model publishing tutorial and feel free to contact us if you have any questions or concerns about publishing your model(s) in the Computational Model Library.

Displaying 10 of 364 results for "Chelsea E Hunter" clear search

ViSA simulates the decision behaviors of different stakeholders showing demands for ecosystem services (ESS) in agricultural landscape. The lack of sufficient supply of ESSs triggers stakeholders to apply different management options to increase their supply. However, while attempting to reduce the supply-demand gap, conflicts arise among stakeholders due to the tradeoff nature of some ESS. ViSA investigates conditions and scenarios that can minimize such supply-demand gap while reducing the risk of conflicts by suggesting different mixes of management options and decision rules.

This model is programmed in Python 3.6. We model how different consensus protocols and trade network topologies affect the performance of a blockchain system. The model consists of multiple trader and miner agents (Trader.py and Tx.py), and one system agent (System.py). We investigated three consensus protocols, namely proof-of-work (PoW), proof-of-stake (PoS), and delegated proof-of-stake (DPoS). We also examined three common trade network topologies: random, small-world, and scale-free. To reproduce our results, you may need to create some databases using, e.g., MySQL; or read and write some CSV files as model configurations.

Peer reviewed Virus Transmission with Super-spreaders

J M Applegate | Published Saturday, September 11, 2021

A curious aspect of the Covid-19 pandemic is the clustering of outbreaks. Evidence suggests that 80\% of people who contract the virus are infected by only 19% of infected individuals, and that the majority of infected individuals faile to infect another person. Thus, the dispersion of a contagion, $k$, may be of more use in understanding the spread of Covid-19 than the reproduction number, R0.

The Virus Transmission with Super-spreaders model, written in NetLogo, is an adaptation of the canonical Virus Transmission on a Network model and allows the exploration of various mitigation protocols such as testing and quarantines with both homogenous transmission and heterogenous transmission.

The model consists of a population of individuals arranged in a network, where both population and network degree are tunable. At the start of the simulation, a subset of the population is initially infected. As the model runs, infected individuals will infect neighboring susceptible individuals according to either homogenous or heterogenous transmission, where heterogenous transmission models super-spreaders. In this case, k is described as the percentage of super-spreaders in the population and the differing transmission rates for super-spreaders and non super-spreaders. Infected individuals either recover, at which point they become resistant to infection, or die. Testing regimes cause discovered infected individuals to quarantine for a period of time.

Pedestrian Scramble

Sho Takami Rami Lake Dara Vancea | Published Tuesday, November 30, 2021 | Last modified Tuesday, June 10, 2025

This is a model intended to demonstrate the function of scramble crossings and a more efficient flow of pedestrian traffic with the presence of diagonal crosswalks.

From Schelling to Schools

V Stoica A Flache | Published Sunday, June 23, 2013

We propose here a computational model of school segregation that is aligned with a corresponding Schelling-type model of residential segregation. To adapt the model for application to school segregation, we move beyond previous work by combining two preference arguments in modeling parents’ school choice, preferences for the ethnic composition of a school and preferences for minimizing the travelling distance to the school.

This model aims to examine how different levels of communication noise and superiority bias affect team performance when solving problems collectively. We used a networked agent-based model of collective problem solving in which agents explore the NK landscape for a better solution and communicate with each other regarding their current solutions. We compared the team performance in solving problems collectively at different levels of self-superiority bias when facing simple and complex problems. Additionally, we addressed the effect of different levels of communication noise on the team’s outcome

SERDUX-MARCIM simulates the propagation of a cyberattack over the computational network of an organization in the maritime sector, at the strategic level of decision-making. It is the instantiation of ABM-MARCIM, the agent-based model of the MARCIM framework for the modeling and simulation of maritime cyberdefense.

Every computational asset of the target organization – servers, endpoints, routers, gateways, vessel systems, radars – is an agent that occupies one of six states at each time step: Susceptible, Exposed, Resistant, Degraded, Unavailable or Destroyed, the initials of which give the model its name. The states Degraded, Unavailable and Destroyed are associated with the D5 cyberattack effects (disrupt, degrade, deny, destroy, deceive) as a function of the degree and the duration of the attack. Thirteen transitions between states are admissible.

Unlike a conventional agent-based model, the local update function is not an individual behavioral rule. It is a system of six ordinary differential equations with eight time-dependent transition rates – propagation, cyberattack (degraded), cyberattack (unavailable), cyberattack (destroyed), recovery, sanitation, loss of resistance, and unavailability by other causes. The values of those rates derive from the capabilities of the target organization, the capabilities of the attacker, and the degree and duration of the cyberattack, computed through a cyber risk approach aligned with the OWASP Risk Rating Methodology, the ISACA categorization of security controls and the IMO Guidelines on Maritime Cyber Risk Management.

Presented here is a socioeconomic agent-based model (ABM) to examine the Hollywood labor system as a network within a simulated movie labor market based on preferential attachment and compare the findings with 50 co-production ego networks during the 2015 movie year. Using the ABM, I test the role slight individual preference for racial and ethnic similarity within one’s own network at the microlevel and find that it is insufficient to explain the phenomena of racial and ethnic underrepresentation at the macrolevel. The ABM also includes the ability to test alternative explanations, such as overt opportunity loss as a possible explanation.

In this model, the spread of a virus disease in a network consisting of school pupils, employed, and umemployed people is simulated. The special feature in this model is the distinction between different types of links: family-, friends-, school-, or work-links. In this way, different governmental measures can be implemented in order to decelerate or stop the transmission.

Organizational Bundle Theory

Alhaji Cherif | Published Monday, December 15, 2008 | Last modified Saturday, April 27, 2013

This model demonstrates the spread of collapse through a network. The model is abstract but has many applications in various fields.

Displaying 10 of 364 results for "Chelsea E Hunter" 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