Combinatorial Entropies and Statistics
arXiv:0902.3038 · doi:10.1140/epjb/e2009-00168-5
Abstract
We examine the {combinatorial} or {probabilistic} definition ("Boltzmann's principle") of the entropy or cross-entropy function or , where is the statistical weight and the probability of a given realization of a system. Extremisation of or , subject to any constraints, thus selects the "most probable" (MaxProb) realization. If the system is multinomial, converges asymptotically (for number of entities $N \back \to \back \infty$) to the Kullback-Leibler cross-entropy ; for equiprobable categories in a system, converges to the Shannon entropy . However, in many cases or is not multinomial and/or does not satisfy an asymptotic limit. Such systems cannot meaningfully be analysed with or , but can be analysed directly by MaxProb. This study reviews several examples, including (a) non-asymptotic systems; (b) systems with indistinguishable entities (quantum statistics); (c) systems with indistinguishable categories; (d) systems represented by urn models, such as "neither independent nor identically distributed" (ninid) sampling; and (e) systems representable in graphical form, such as decision trees and networks. Boltzmann's combinatorial definition of entropy is shown to be of greater importance for {"probabilistic inference"} than the axiomatic definition used in information theory.
Invited contribution to the SigmaPhi 2008 Conference; accepted by EPJB volume 69 issue 3 June 2009
References in corpus (3)
Cited by in corpus (6)
- Cluster-based reduced-order modelling of a mixing layer
- New features of quantum discord uncovered by q-entropies
- Automatic analysis of artistic paintings using information-based measures
- A New Method for Derivation of Statistical Weight of the Gentile Statistics
- Maximum-Entropy Weighting of Multi-Component Earth Climate Models
- Derivation of a statistical model for classical systems obeying fractional exclusion principle