My greatest concern was what to call it. I thought of calling it “information”, but the word was overly used, so I decided to call it “uncertainty”. When I discussed it with John von Neumann, he had a better idea. Von Neumann told me, “You should call it entropy, for two reasons. In the first place your uncertainty function has been used in statistical mechanics under that name, so it already h...

The time operator and internal age are intrinsic features of entropy producing innovation processes. The innovation spaces at each stage are the eigenspaces of the time operator. The internal age is the average innovation time, analogous to lifetime computation. Time operators were originally introduced for quantum systems and highly unstable dynamical systems. Extending the time operator theor...

The entropy of a closure operator has been recently proposed for the study of network coding and secret sharing. In this paper, we study closure operators in relation to their entropy. We first introduce four different kinds of rank functions for a given closure operator, which determine bounds on the entropy of that operator. This yields new axioms for matroids based on their closure operators...

We investigate the relation between the small deviation problem for a symmetric α-stable random vector in a Banach space and the metric entropy properties of the operator generating it. This generalizes former results due to Li and Linde and to Aurzada. It is shown that this problem is related to the study of the entropy numbers of a certain random operator. In some cases an interesting gap app...

The aim of this study was to determine the effects of prenatal cocaine exposure (PCE) on the dynamics of heart rate variability in full-term neonates during sleep. R-R interval (RRI) time series from 9 infants with PCE and 12 controls during periods of stable quiet sleep and active sleep were analyzed using autoregressive modeling and nonlinear dynamics. There were no differences between the tw...

The entropy of a closure operator has been recently proposed for the study of network coding and secret sharing. In this paper, we study closure operators in relation to their entropy. We first introduce four different kinds of rank functions for a given closure operator, which determine bounds on the entropy of that operator. This yields new axioms for matroids based on their closure operators...

Shannon’s entropy is a basic quantity in information theory, and a fundamental building block for the analysis of neural codes. Estimating the entropy of a discrete distribution from samples is an important and difficult problem that has received considerable attention in statistics and theoretical neuroscience. However, neural responses have characteristic statistical structure that generic en...