CoMSES Net maintains cyberinfrastructure to foster FAIR data principles for access to and (re)use of computational models. Model authors can publish their model code in the Computational Model Library with documentation, metadata, and data dependencies and support these FAIR data principles as well as best practices for software citation. Model authors can also request that their model code be peer reviewed to receive a DOI. All users of models published in the library must cite model authors when they use and benefit from their code.
CoMSES Net also maintains a curated database of over 7500 publications of agent-based and individual based models with additional metadata on availability of code and bibliometric information on the landscape of ABM/IBM publications that we welcome you to explore.
This model is designed to address the following research question: How does the amount and topology of intergroup cultural transmission modulate the effect of local group extinction on selectively neutral cultural diversity in a geographically structured population? The experimental design varies group extinction rate, the amount of intergroup cultural transmission, and the topology of intergroup cultural transmission while measuring the effects of local group extinction on long-term cultural change and regional cultural differentiation in a constant-size, spatially structured population. The results show that for most of the intergroup social network topologies tested here, increasing the amount of intergroup cultural transmission (similar to increasing gene flow in a genetic model) erases the negative effect of local group extinction on selectively neutral cultural diversity. The stochastic (i.e., preference attachment) network seems to stand out as an exception.
A minimal genetic algorithm was preliminarily developed to search for the solution of an elementary arithmetic problem. It has been modified to explore the effect of a mutator gene and the consequent entrance into a hypermutation state. The phenomenon is particularly important in some types of tumorigenesis and in a more general way, in cells and tissues submitted to chronic sublethal environmental or genomic stress.
Since a long time, some scholars suppose that organisms speed up their own evolution by varying mutation rate, but evolutionary biologists are not convinced that evolution can select a mechanism promoting more (often harmful) mutations looking forward an environmental challenge. The aim of the model is to shed light on these controversial points of views.
Evolution of Sex is a NetLogo model that illustrates the advantages and disadvantages of sexual and asexual reproductive strategies. It seeks to demonstrate the answer to the question “Why do we have sex?”
Agers and non-agers agent compete over a spatial landscape. When two agents occupy the same grid, who will survive is decided by a random draw where chances of survival are proportional to fitness. Agents have offspring each time step who are born at a distance b from the parent agent and the offpring inherits their genetic fitness plus a random term. Genetic fitness decreases with time, representing environmental change but effective non-inheritable fitness can increase as animals learn and get bigger.
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 candidate solutions to the problem are represented by agents, that in logo programming environment are usually known as “turtles”.
This model simulates the mechanisms of evolution, or how allele frequencies change in a population over time.
The community consequences of intra-specific trait variation (ITV) are a current topic in ecological research. The effects of ITV on species coexistence have, yet, not sufficiently been understood. With this individual-based model we analyzed the effect of intra-specific variation in movement by mimicking variation found in ground-dwelling rodents and analyzing how such variation affects inter-specific differences in competitive ability (i.e. foraging efficiency) and temporary coexistence. The movement algorithm and behavioral plasticity was adapted from existing algorithms and current ecological literature. As a measure for temporary coexistence, we analyzed the time until one of the species went extinct.
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
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.
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”