Review of data structures for computationally efficient nearest-neighbour entropy estimators for large systems with periodic boundary conditions

Title
Review of data structures for computationally efficient nearest-neighbour entropy estimators for large systems with periodic boundary conditions
Authors
Keywords
Information theory, Transfer entropy, Periodic boundary conditions, Spatial partitioning
Journal
Journal of Computational Science
Volume 23, Issue -, Pages 109-117
Publisher
Elsevier BV
Online
2017-10-27
DOI
10.1016/j.jocs.2017.10.019

Ask authors/readers for more resources

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started