Rényi–Sobolev Inequalities and Connections to Spectral Graph Theory

06/21/2023
by   Lei Yu, et al.
0

In this paper, we generalize the log-Sobolev inequalities to Rényi–Sobolev inequalities by replacing the entropy with the two-parameter entropy, which is a generalized version of entropy closely related to Rényi divergences. We derive the sharp nonlinear dimension-free version of this kind of inequalities. Interestingly, the resultant inequalities show a phase transition depending on the parameters. We then connect Rényi–Sobolev inequalities to the spectral graph theory. Our proofs in this paper are based on the information-theoretic characterization of the Rényi–Sobolev inequalities, as well as the method of types.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2021

Strong Brascamp-Lieb Inequalities

In this paper, we derive sharp nonlinear dimension-free Brascamp-Lieb in...
research
10/01/2018

The information-theoretic meaning of Gagliardo--Nirenberg type inequalities

Gagliardo--Nirenberg inequalities are interpolation inequalities which w...
research
04/02/2019

Combinatorial inequalities

This is an expanded version of the Notices of the AMS column with the sa...
research
02/25/2022

The concavity of generalized entropy powers

In this note we introduce a new family of entropy powers which are relat...
research
09/13/2016

Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting

We derive a new proof to show that the incremental resparsification algo...
research
12/04/2017

Discrete Entropy Power Inequalities via Sperner Theory

A ranked poset is called strongly Sperner if the size of k-family cannot...
research
11/02/2022

Common Information, Noise Stability, and Their Extensions

Common information (CI) is ubiquitous in information theory and related ...

Please sign up or login with your details

Forgot password? Click here to reset