Review of data structures for computationally efficient nearest-neighbour entropy estimators for large systems with periodic boundary conditions
Authors:
- Joshua M. BrownJBJoshua M. Brown
- Terry BossomaierTBTerry Bossomaier
- Lionel BarnettLBLionel Barnett
- 1 November 2017
- journal article
- review article
- Published by Elsevier in Journal of Computational Science
- Vol. 23, 109-117
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Australian Research Council (LE140100002)
This publication has 22 references indexed in Scilit:
- Assessing Coupling Dynamics from an Ensemble of Time SeriesEntropy, 2015
- Information Flow in a Kinetic Ising Model Peaks in the Disordered PhasePhysical Review Letters, 2013
- Transfer Entropy for Coupled Autoregressive ProcessesEntropy, 2013
- Phase-transition–like behaviour of information measures in financial marketsEurophysics Letters, 2009
- Efficient calculation of configurational entropy from molecular simulations by combining the mutual‐information expansion and nearest‐neighbor methodsJournal of Computational Chemistry, 2008
- The mean distance to the n th neighbour in a uniform distribution of random points: an application of probability theoryEuropean Journal of Physics, 2008
- Higher-dimensional voronoi diagrams in linear expected timeDiscrete & Computational Geometry, 1991
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- ber den gegenseitigen durchschnittlichen Abstand von Punkten, die mit bekannter mittlerer Dichte im Raume angeordnet sindMathematische Annalen, 1909