Entropy on a Hypergraph The entropy of the distribution of derivations in a hypergraph 14 is provided that we define r e def = log p e (so that r(d) = e∈d r e = log p(d)).
when using this semiring to compute second derivatives (Case 2) or covariances, one may exploit the invariant that r = s, e.g., to avoid storing s and to compute r1s2 + s1r2 in multiplication simply as 2 • r1r2.