Modified logarithmic Sobolev inequalities in discrete settings (Q867071): Difference between revisions

The authors study modified versions of logarithmic Sobolev inequalities in the discrete setting of finite Markov chains and graphs. These inequalities turn out to be weaker than the standard log-Sobolev inequality, but stronger than the Poincaré (spectral gap) inequality. They show that, for bounded degree expander graphs, various log-Sobolev constants go to zero with the size of the graph. They also derive a hypercontractivity formulation equivalent to their main modified log-Sobolev inequality.