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

Joshua M. Brown, Terry Bossomaier, Lionel Barnett

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

Information theoretic quantities are extremely useful in discovering relationships between two or more data sets. One popular method—particularly for continuous systems—for estimating these quantities is the nearest neighbour estimators. When system sizes are very large or the systems have periodic boundary conditions issues with performance and correctness surface, however solutions are known for each problem. Here we show that these solutions are inappropriate in systems that simultaneously contain both features and discuss a lesser known alternative solution involving Vantage Point trees that is capable of addressing both issues.

Original languageEnglish
Pages (from-to)109-117
Number of pages9
JournalJournal of Computational Science
Volume23
Early online date26 Oct 2017
DOIs
Publication statusPublished - Nov 2017

Fingerprint

Dive into the research topics of 'Review of data structures for computationally efficient nearest-neighbour entropy estimators for large systems with periodic boundary conditions'. Together they form a unique fingerprint.

Cite this