Papers › Threshold-free estimation of entropy from a Pearson matrix
Threshold-free estimation of entropy from a Pearson matrix
H. Felippe, A. Viol, D. B. de Araujo, M. G. E. da Luz, F. Palhano-Fontes, H. Onias, E. P. Raposo, G. M. Viswanathan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
There is demand in diverse fields for a reliable method of estimating the entropy associated with correlations. The estimation of a unique entropy directly from the Pearson correlation matrix has remained an open problem for more than half a century. All existing approaches lack generality insofar as they require thresholding choices that arbitrarily remove possibly important information. Here we propose an objective procedure for directly estimating a unique entropy of a general Pearson matrix. We show that upon rescaling the Pearson matrix satisfies all necessary conditions for an analog of the von Neumann entropy to be well defined. No thresholding is required. We demonstrate the method by estimating the entropy from neuroimaging time series of the human brain under the influence of a psychedelic.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections