Computational Model Library

The purpose of this model is explore how “friend-of-friend” link recommendations, which are commonly used on social networking sites, impact online social network structure. Specifically, this model generates online social networks, by connecting individuals based upon varying proportions of a) connections from the real world and b) link recommendations. Links formed by recommendation mimic mutual connection, or friend-of-friend algorithms. Generated networks can then be analyzed, by the included scripts, to assess the influence that different proportions of link recommendations have on network properties, specifically: clustering, modularity, path length, eccentricity, diameter, and degree distribution.

Peer reviewed MGA - Minimal Genetic Algorithm

Cosimo Leuci | Published Tue Sep 3 07:52:29 2019 | Last modified Thu Jan 30 08:42:08 2020

Genetic algorithms try to solve a computational problem following some principles of organic evolution. This model has educational purposes; it can give us an answer to the simple arithmetic problem on how to find the highest natural number composed by a given number of digits. We approach the task using a genetic algorithm, where the possible answers to solve the problem are represented by agents, that in logo programming environment are usually known as “turtles”.

Peer reviewed Flibs'NLogo - An elementary form of evolutionary cognition

Cosimo Leuci | Published Thu Jan 30 08:34:19 2020

Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”

Cultural Spread

Salvador Pardo-Gordó Salvador Pardo Gordó | Published Thu Apr 2 11:44:34 2015 | Last modified Wed Nov 27 15:56:42 2019

The purpose of the model is to simulate the cultural hitchhiking hypothesis to explore how neutral cultural traits linked with advantageous traits spread together over time

NarcoLogic

Nicholas Magliocca | Published Thu Aug 29 18:35:53 2019

Investigate spatial adaptive behaviors of narco-trafficking networks in response to various counterdrug interdiction strategies within the cocaine transit zone of Central America and associated maritime areas. Through the novel application of the ‘complex adaptive systems’ paradigm, we implement a potentially transformative coupled agent-based and interdiction optimization modeling approach to compellingly demonstrate: (a) how current efforts to disrupt narco-trafficking networks are in fact making them more widespread, resilient, and economically powerful; (b) the potential for alternative interdiction approaches to weaken and contain traffickers.

PowerGen-ABM is an optimisation model for power plant expansions from 2010 to 2025 with Indonesian electricity systems as the case study. PowerGen-ABM integrates three approaches: techno-economic analysis (TEA), linear programming (LP), and input-output analysis (IOA) and environmental analysis. TEA is based on the revenue requirement (RR) formula by UCDavis (2016), and the environmental analysis accounts for resource consumption (i.e., steel, concrete, aluminium, and energy) and carbon dioxide equivalent (CO2e) emissions during the construction and operational stages of power plants.

Agent-Based Computational Model of the cryptocurrency Bitcoin with a realistic market and transaction system. Bitcoin’s transaction limit (i.e. block size) and Bitcoin generation can be calibrated and optimized for wealth and network’s hashing power by the Non-Dominated Sorted Genetic Algorithm - II.

Neolithic Spread Model Version 1.0

Sean Bergin Michael Barton Salvador Pardo Gordo Joan Bernabeu Auban | Published Thu Dec 11 19:12:19 2014 | Last modified Mon Dec 31 17:39:18 2018

This model simulates different spread hypotheses proposed for the introduction of agriculture on the Iberian peninsula. We include three dispersal types: neighborhood, leapfrog, and ideal despotic distribution (IDD).

In order to test how prosocial strategies (compassionate altruism vs. reciprocity) grow over time, we developed an evolutionary simulation model where artificial agents are equipped with different emotionally-based drivers that vary in strength. Evolutionary algorithms mimic the evolutionary selection process by letting the chances of agents conceiving offspring depend on their fitness. Equipping the agents with heritable prosocial strategies allows for a selection of those strategies that result in the highest fitness. Since some prosocial attributes may be more successful than others, an initially heterogeneous population can specialize towards altruism or reciprocity. The success of particular prosocial strategies is also expected to depend on the cultural norms and environmental conditions the agents live in.

Ant Colony Optimization for infrastructure routing

P W Heijnen Emile Chappin Igor Nikolic | Published Wed Mar 5 09:49:07 2014 | Last modified Sat Mar 24 10:33:19 2018

The mode implements a variant of Ant Colony Optimization to explore routing on infrastructures through a landscape with forbidden zones, connecting multiple sinks to one source.

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.