Modified Logarithmic Sobolev Inequalities in Discrete Settings
By Sergey G. Bobkov, Prasad Tetali. 2006
202 citations recorded by the source corpus.
Subfields: Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/4d4c918044ac36cfe52285e9c580d2499402d52e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Numerical Analysis
- Nathael Gozlan
- Cyril Roberto
- Franck Barthe
- Maxim Raginsky
- Dario Cordero-Erausquin
- Prasad Tetali
- Paul-Marie Samson
- Emanuel Milman
Citations in the corpus
- Displacement convexity of entropy and related inequalities on graphs (2012, unknown): “[7] , [10], [5], [13], [14], [46], [44].”
- Strong Data Processing Inequalities and $\Phi $ -Sobolev Inequalities for Discrete Channels (2014, methodology): “…we have Applying this and Theorem IV.4, we get the following upper and lower bounds on the log-Sobolev constant ˜ ρ 1 : Unfortunately, neither of the bounds is tight, since the log-Sobolev constant in this case is known exactly: ˜ ρ 1 (cid:29) Bern ( 1 / 2 ), BSC (ε) (cid:30) = ε [26, Example 3.9].”
- Kantorovich duality for general transport costs and applications (2014, background): “[52, 12]), the other terms are far from well understood.”
- Correlation and Brascamp–Lieb Inequalities for Markov Semigroups (2009, background): “In the discrete case, some examples of superadditive inequalities for Fisher information were implicitly obtained in the papers [9, 18, 19].”