Computational Model Library

Displaying 10 of 1088 results for "J A Cuesta" clear search

An agent-based framework that aggregates social network-level individual interactions to run targeting and rewarding programs for a freemium social app. Git source code in https://bitbucket.org/mchserrano/socialdynamicsfreemiumapps

Peer reviewed DogFoxCDVspillover

Aniruddha Belsare Matthew Gompper | Published Thursday, March 16, 2017 | Last modified Tuesday, April 04, 2017

The purpose of this model is to better understand the dynamics of a multihost pathogen in two host system comprising of high densities of domestic hosts and sympatric wildlife hosts susceptible to the pathogen.

Our model is hybrid agent-based and equation based model for human air-borne infectious diseases measles. It follows an SEIR (susceptible, exposed,infected, and recovered) type compartmental model with the agents moving be-tween the four state relating to infectiousness. However, the disease model canswitch back and forth between agent-based and equation based depending onthe number of infected agents. Our society model is specific using the datato create a realistic synthetic population for a county in Ireland. The modelincludes transportation with agents moving between their current location anddesired destination using predetermined destinations or destinations selectedusing a gravity model.

Stylized agricultural land-use model for resilience exploration

Patrick Bitterman | Published Tuesday, June 14, 2016 | Last modified Monday, April 08, 2019

This model is a highly stylized land use model in the Clear Creek Watershed in Eastern Iowa, designed to illustrate the construction of stability landscapes within resilience theory.

Leviathan model and its approximation

Thibaut Roubin Guillaume Deffuant | Published Thursday, September 17, 2020 | Last modified Monday, September 06, 2021

The model is based on the influence function of the Leviathan model (Deffuant, Carletti, Huet 2013 and Huet and Deffuant 2017). We aim at better explaining some patterns generated by this model, using a derived mathematical approximation of the evolution of the opinions averaged.

We consider agents having an opinion/esteem about each other and about themselves. During dyadic meetings, agents change their respective opinion about each other, and possibly about other agents they gossip about, with a noisy perception of the opinions of their interlocutor. Highly valued agents are more influential in such encounters.

We show that the inequality of reputations among agents have a negative effect on the opinions about the agents of low status.The mathematical analysis of the opinion dynamic shows that the lower the status of the agent, the more detrimental the interactions are for the opinions about this agent, especially when gossip is activated, while the interactions always tend to increase the opinions about agents of high status.

Objective of our model is to simulate the emergence and operation of a technological niches (TN) in terms of actors’ interaction. A TN can be conceived as protected socio-economic space where radical innovations are developed and tested

The model explores the emergence of inequality in cognitive and socio-emotional skills at the societal level within and across generations that results from differences in parental investment behavior during childhood and adolescence.

This spatially explicit agent-based model addresses how effective foraging radius (r_e) affects the effective size–and thus the equilibrium cultural diversity–of a structured population composed of central-place foraging groups.

This model is intended to study the way information is collectively managed (i.e. shared, collected, processed, and stored) in a system and how it performs during a crisis or disaster. Performance is assessed in terms of the system’s ability to provide the information needed to the actors who need it when they need it. There are two main types of actors in the simulation, namely communities and professional responders. Their ability to exchange information is crucial to improve the system’s performance as each of them has direct access to only part of the information they need.

In a nutshell, the following occurs during a simulation. Due to a disaster, a series of randomly occurring disruptive events takes place. The actors in the simulation need to keep track of such events. Specifically, each event generates information needs for the different actors, which increases the information gaps (i.e. the “piles” of unaddressed information needs). In order to reduce the information gaps, the actors need to “discover” the pieces of information they need. The desired behavior or performance of the system is to keep the information gaps as low as possible, which is to address as many information needs as possible as they occur.

Peer reviewed Correlated Random Walk (NetLogo)

Viktoriia Radchuk Uta Berger Thibault Fronville | Published Tuesday, May 09, 2023 | Last modified Monday, December 18, 2023

This is NetLogo code that presents two alternative implementations of Correlated Random Walk (CRW):
- 1. drawing the turning angles from the uniform distribution, i.e. drawing the angle with the same probability from a certain given range;
- 2. drawing the turning angles from von Mises distribution.
The move lengths are drawn from the lognormal distribution with the specified parameters.

Correlated Random Walk is used to represent the movement of animal individuals in two-dimensional space. When modeled as CRW, the direction of movement at any time step is correlated with the direction of movement at the previous time step. Although originally used to describe the movement of insects, CRW was later shown to sufficiently well describe the empirical movement data of other animals, such as wild boars, caribous, sea stars.

Displaying 10 of 1088 results for "J A Cuesta" 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