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 3 of 3 results eschansfeedback clear search

Feedback Loop Example: Wildland Fire Spread

James Millington | Published Friday, December 21, 2012 | Last modified Saturday, April 27, 2013

This model is a replication of that described by Peterson (2002) and illustrates the ‘spread’ feedback loop type described in Millington (2013).

Feedback Loop Example: Forest Resource Transport

James Millington | Published Friday, December 21, 2012 | Last modified Saturday, April 27, 2013

This model illustrates a positive ‘transport’ feedback loop in which lines with different resistance to flows of material result in variation in rates of change in linked entities.

Feedback Loop Example: Vegetation Patch Growth

James Millington | Published Thursday, December 20, 2012 | Last modified Saturday, April 27, 2013

This model illustrates a positive ‘growth’ feedback loop in which the areal extent of an entity increases through time.

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