CoChat

kmos: A lattice kinetic Monte Carlo framework

Open access
Hoffmann, Max J., Matera, Sebastian, Reuter, Karsten · 2014 · Computer Physics Communications
Cited by 123

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

Kinetic Monte Carlo (kMC) simulations have emerged as a key tool for microkinetic modeling in heterogeneous catalysis and other materials applications. Systems, where site-specificity of all elementary reactions allows a mapping onto a lattice of discrete active sites, can be addressed within the particularly efficient lattice kMC approach. To this end we describe the versatile kmos software package, which offers a most user-friendly implementation, execution, and evaluation of lattice kMC models of arbitrary complexity in one- to three-dimensional lattice systems, involving multiple active sites in periodic or aperiodic arrangements, as well as site-resolved pairwise and higher-order lateral interactions. Conceptually, kmos achieves a maximum runtime performance which is essentially independent of lattice size by generating code for the efficiency-determining local update of available events that is optimized for a defined kMC model. For this model definition and the control of all runtime and evaluation aspects kmos offers a high-level application programming interface. Usage proceeds interactively, via scripts, or a graphical user interface, which visualizes the model geometry, the lattice occupations and rates of selected elementary reactions, while allowing on-the-fly changes of simulation parameters. We demonstrate the performance and scaling of kmos with the application to kMC models for surface catalytic processes, where for given operation conditions (temperature and partial pressures of all reactants) central simulation outcomes are catalytic activity and selectivities, surface composition, and mechanistic insight into the occurrence of individual elementary processes in the reaction network.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.cpc.2014.04.003

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Python for scientific computing

    Oliphant, T. E. (2007) · Computing in Science & Engineering · doi:10.1109/mcse.2007.58 · Cited by 3,303 · cited 1×

    “kmos offers a concise API which allows to control all runtime aspects of a compiled model including setup and evaluation, as a script or interactively using IPython [56] and numpy [57], as well as a GUI which visualizes the model geometry using ASE [51] and coverages and turnover frequencies using matplotlib [58], whi…”
    Method
  • Constructing optimal binary decision trees is NP-complete

    Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959 · cited 1×

    “n arises whether there is an optimal way how to arrange the corresponding queries. The corresponding problem of constructing an optimal binary decision tree has generally been shown to be NP-complete [53]. In the kMC context the corresponding intricacy is given in loose terms by the fact that frequent local lattice co…”
    Background

Show all 2 references

Cited by

See all 123

Metadata

Authors
Hoffmann, M. J., Matera, S., & Reuter, K.
Venue
Computer Physics Communications
Publisher
Elsevier BV
Published
2014-07
Volume
185
Issue
7
Pages
2138-2150
ISSN
0010-4655 (ISSN-L)
OpenAlex
W1970335552
Cited by
123
References
2
FWCI
3.57
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: kmos: A lattice kinetic Monte Carlo framework. https://app.cochat.ai/papers/10.1016/j.cpc.2014.04.003
The paper
Hoffmann, M. J., Matera, S., & Reuter, K. (2014). kmos: A lattice kinetic Monte Carlo framework. Computer Physics Communications. https://doi.org/10.1016/j.cpc.2014.04.003

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.