DOI link to JOSS article Test status Link to conda-forge page Link to binder example notebook Link Zenodo archive

A tiny package to compute the dynamics of stochastic and molecular simulations.


BSD 3-clause


Pierre de Buyl






  • performs the computation of mean-square displacements and correlation functions.

  • accepts as input NumPy arrays storing the positions and velocities of particles.

  • implements the so-called Fast Correlation Algorithm proposed by Kneller and others [KKKS95] for the nMOLDYN analysis program.

  • depends only Python and NumPy.

For a quick jump into tidynamics, have a look at the examples.

Goals and plans:

  • Minimal dependencies.

  • Serve as a reference implementation for common algorithms that are useful for molecular and stochastic simulations.

  • Provide later a bit more flexibility to handle cross correlations and many-body systems.


It is necessary to have Python and NumPy to install and use tidynamics.

tidynamics can be installed with pip:

pip install --user tidynamics

or with conda (via conda-forge):

conda install -c conda-forge tidynamics

It is also possible to download the source code and execute pip locally.

Tests are run with Python 3.7 to 3.11. Python 2 is not supported anymore. If you encounter any issue, let me know (see Contact, support, and contribution information below).


When using tidynamics in a publication, please cite the following paper:

Pierre de Buyl (2018), tidynamics: A tiny package to compute the dynamics of stochastic and molecular simulations, The Journal of Open Source Software https://doi.org/10.21105/joss.00877

The BibTeX entry can be found in CITATION.


We use pytest for testing:

python -m pytest

Installing tidynamics does not install the tests. It is necessary to download tidynamics’ source and to install pytest to run the tests.

Contact, support, and contribution information

To contact the author about tidynamics, you can either write an email to Pierre de Buyl or use the issue tracker of the GitHub project.

Bug reports are welcome. If you consider proposing a feature, please keep in mind the goals and plans exposed above.

Contributors are listed in Contributors.