Generalizing Körner's graph entropy to graphons

08/31/2022
by   Viktor Harangi, et al.
0

Körner introduced the notion of graph entropy in 1973 as the minimal code rate of a natural coding problem where not all pairs of letters can be distinguished in the alphabet. Later it turned out that it can be expressed as the solution of a minimization problem over the so-called vertex-packing polytope. In this paper we generalize this notion to graphons. We show that the analogous minimization problem provides an upper bound for graphon entropy. We also give a lower bound in the shape of a maximization problem. The main result of the paper is that for most graphons these two bounds actually coincide and hence precisely determine the entropy in question. Furthermore, graphon entropy has a nice connection to the fractional chromatic number and the fractional clique number (defined for graphons by Hladký and Rocha).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2022

Conditional graph entropy as an alternating minimization problem

The systematic study of alternating minimization problems was initiated ...
research
05/16/2018

Remote Source Coding under Gaussian Noise : Dueling Roles of Power and Entropy Power

The distributed remote source coding (so-called CEO) problem is studied ...
research
12/21/2017

Bounds on the Entropy of a Function of a Random Variable and their Applications

It is well known that the entropy H(X) of a discrete random variable X i...
research
03/25/2021

Information theoretic parameters of non-commutative graphs and convex corners

We establish a second anti-blocker theorem for non-commutative convex co...
research
06/27/2020

Generic Transformations Have Zero Lower Slow Entropy and Infinite Upper Slow Entropy

The notion of slow entropy, both upper and lower slow entropy, were defi...
research
01/24/2020

A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes

We propose a novel technique for constructing a graph representation of ...
research
06/27/2020

Genericity and Rigidity for Slow Entropy Transformations

The notion of slow entropy, both upper and lower slow entropy, was defin...

Please sign up or login with your details

Forgot password? Click here to reset