Search arXivSearch

arXiv · 1911.03685

Estimation of entropy measures for categorical variables with spatial correlation

Abstract

Entropy is a measure of heterogeneity widely used in applied sciences, often when data are collected over space. Recently, a number of approaches has been proposed to include spatial information in entropy. The aim of entropy is to synthesize the observed data in a single, interpretable number. In other studies the objective is, instead, to use data for entropy estimation; several proposals can be found in the literature, which basically are corrections of the estimator based on substituting the involved probabilities with proportions. In this case, independence is assumed and spatial correlation is not considered. We propose a path for spatial entropy estimation: instead of correcting the global entropy estimator, we focus on improving the estimation of its components, i.e. the probabilities, in order to account for spatial effects. Once probabilities are suitably evaluated, estimating entropy is straightforward since it is a deterministic function of the distribution. Following a Bayesian approach, we derive the posterior probabilities of a multinomial distribution for categorical variables, accounting for spatial correlation. A posterior distribution for entropy can be obtained, which may be synthesized as wished and displayed as an entropy surface for the area under study.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Linda Altieri, Daniela Cocchi, Giulia Roli. 2019-11-09. Estimation of entropy measures for categorical variables with spatial correlation. https://arxiv.org/abs/1911.03685

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A note on the distribution of the partial correlation coefficient with nonparametrically estimated marginal regressions

There has been much interest in the nonparametric testing of conditional independence in the econometric and statistical literature, but the simplest and potentially most useful method, based on the sample partial correlation, seems to have been overlooked, its distribution only having been investigated in some simple parametric instances. The present note shows that an easy to apply permutation test based on the sample partial correlation with nonparametrically estimated marginal regressions has good large and small sample properties.

math.ST

Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests

We consider the problem of sequential hypothesis testing using $e$-processes. For a rich class of composite testing problems---which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases---we show that any $e$-process satisfying a certain sublinear regret bound is asymptotically and almost surely instance-log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems, and we provide explicit test supermartingales and $e$-processes satisfying this notion in a more general case. Furthermore, we derive matching lower and upper bounds on the expected rejection time in the high-confidence regime for the resulting sequential tests in all of these cases. The proofs of these results make weak, algorithm-agnostic moment assumptions and rely on a proof technique involving the aforementioned regret and a family of numeraire portfolios. Finally, we discuss how all of these theorems hold in a distribution-uniform sense, a notion of log-optimality that is stronger still and seems to be new to the literature.

math.ST

Common Drivers in Sparsely Interacting Hawkes Processes

We study a multivariate Hawkes process as a model for time-continuous relational event networks. The model does not assume the network to be known, it includes covariates, and it allows for both common drivers, parameters common to all the actors in the network, and also local parameters specific for each actor. We derive rates of convergence for all of the model parameters when both the number of actors and the time horizon tends to infinity. To prevent an exploding network, sparseness is assumed. We also discuss numerical aspects.

math.ST