Entropy, Derivation Operators and Huffman Trees

07/23/2021
by   Simon Burton, et al.
0

We build a theory of binary trees on finite multisets that categorifies, or operationalizes, the entropy of a finite probability distribution. Multisets operationalize probabilities as the event outcomes of an experiment. Huffman trees operationalize the entropy of the distribution of these events. We show how the derivation property of the entropy of a joint distribution lifts to Huffman trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2018

Entropy rates for Horton self-similar trees

In this paper we examine planted binary plane trees. First, we provide a...
research
03/16/2019

Entropy modulo a prime

Building on work of Kontsevich, we introduce a definition of the entropy...
research
01/08/2008

Imprecise probability trees: Bridging two theories of imprecise probability

We give an overview of two approaches to probability theory where lower ...
research
06/01/2020

A Comparison of Empirical Tree Entropies

Whereas for strings, higher-order empirical entropy is the standard entr...
research
12/08/2019

Contrast Trees and Distribution Boosting

Often machine learning methods are applied and results reported in cases...
research
03/23/2019

Density and Fractal Property of the Class of Oriented Trees

We show the density theorem for the class of finite oriented trees order...
research
07/20/2021

Entropy as a Topological Operad Derivation

We share a small connection between information theory, algebra, and top...

Please sign up or login with your details

Forgot password? Click here to reset