All beauty, richness and harmony in the emergent dynamics of a complex system largely
depend on the specific way in which its elementary components interact. The last twenty-five …

About 160 years ago, the concept of entropy was introduced in thermodynamics by Rudolf
Clausius. Since then, it has been continually extended, interpreted, and applied by …

Csiszár and Körner's book is widely regarded as a classic in the field of information theory,
providing deep insights and expert treatment of the key theoretical issues. It includes in …

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

This survey seeks to describe methods for measuring the entropy of graphs and to
demonstrate the wide applicability of entropy measures. Setting the scene with a review of …

Boolean circuit complexity is the combinatorics of computer science and involves many
intriguing problems that are easy to state and explain, even for the layman. This book is a …

A sender communicates with a receiver who wishes to reliably evaluate a function of their
combined data. We show that if only the sender can transmit, the number of bits required is a …

This paper introduces a general framework for defining the entropy of a graph. Our definition
is based on a local information graph and on information functionals derived from the …

This paper presents a taxonomy and overview of approaches to the measurement of graph
and network complexity. The taxonomy distinguishes between deterministic (eg …

This paper studies the minimum achievable source coding rate as a function of blocklength
n and probability ϵ that the distortion exceeds a given level d. Tight general achievability …