2017/12/13 by Leinster, Tom · 1 citation
#FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Information Theory (cs.IT) #Mathematical Physics (math-ph) #Statistics Theory (math.ST)
paper · doi:10.48550/arxiv.1712.04903
We prove characterization theorems for relative entropy (also known as Kullback-Leibler divergence), q-logarithmic entropy (also known as Tsallis entropy), and q-logarithmic relative entropy. All three have been characterized axiomatically before, but we show that earlier proofs can be simplified considerably, at the same time relaxing some of the hypotheses.