Dependence assessment based on generalized relative complexity: application to sampling network design

DOI10.1007/s11009-016-9495-6zbMath1349.94105OpenAlexW2316487028MaRDI QIDQ340137

M. C. Bueso, Francisco Javier Alonso, José M. Angulo

Publication date: 11 November 2016

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-016-9495-6

zbMATH Keywords

Shannon entropystatistical complexityRényi entropygeneralized mutual informationspatial sampling

Mathematics Subject Classification ID

Inference from spatial processes (62M30) Measures of information, entropy (94A17)

Related Items (1)

An application of information theory to stochastic classical gravitational fields

Cites Work

• Unnamed Item
• The generalized cross entropy method, with applications to probability density estimation
• Optimal monitoring network designs
• Axiomatic characterizations of information measures
• On measures of information and their characterizations
• What is complexity?
• Effect of data transformations on predictive risk indicators
• Some features of the López-Ruiz-Mancini-Calbet (LMC) statistical measure of complexity.
• Multifractal analyses of music sequences
• Fundamental properties of Tsallis relative entropy
• A generalized statistical complexity measure: Applications to quantum systems
• On Information and Sufficiency
• A study on sampling design for optimal prediction of space-time stochastic processes

This page was built for publication: Dependence assessment based on generalized relative complexity: application to sampling network design