Entropic exercises around the Kneser-Poulsen conjecture

10/23/2022
by   Gautam Aishwarya, et al.
0

We develop an information-theoretic approach to study the Kneser–Poulsen conjecture in discrete geometry. This leads us to a broad question regarding whether Rényi entropies of independent sums decrease when one of the summands is contracted by a 1-Lipschitz map. We answer this question affirmatively in various cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2018

Information Theoretic Interpretation of Deep learning

We interpret part of the experimental results of Shwartz-Ziv and Tishby ...
research
07/10/2018

The Kannan-Lovász-Simonovits Conjecture

The Kannan-Lovász-Simonovits conjecture says that the Cheeger constant o...
research
11/13/2021

A discrete complement of Lyapunov's inequality and its information theoretic consequences

We establish a reversal of Lyapunov's inequality for monotone log-concav...
research
04/18/2023

Searching for ribbons with machine learning

We apply Bayesian optimization and reinforcement learning to a problem i...
research
03/17/2021

The least favorable noise

Suppose that a random variable X of interest is observed perturbed by in...
research
12/18/2022

Manin conjecture for statistical pre-Frobenius manifolds, hypercube relations and motivic Galois group in coding

This article develops, via the perspective of (arithmetic) algebraic geo...
research
12/27/2018

Asymptotic comparison of two-stage selection procedures under quasi-Bayesian framework

This paper revisits the procedures suggested by Dudewicz and Dalal (1975...

Please sign up or login with your details

Forgot password? Click here to reset