Fetching the paper…
Reading the bibliography…
The data-processing inequality, that is, $I(U;Y) \le I(U;X)$ for a Markov chain $U \to X \to Y$, has been the method of choice for proving impossibility (converse) results in information theory and many other disciplines.
Extension of the law of large numbers to dependent quantities
Andrey Andreyevich Markov · 1906
Earlier work this paper cites.
Le cas discontinu des probabilités en chaîne
Wolfgang Doeblin · 1937
Earlier work this paper cites.
Central limit theorem for nonstationary Markov chains. I
R. L. Dobrushin · 1956
Earlier work this paper cites.
Extensions of Jentzsch’s theorem
G. Birkhoff · 1957
Earlier work this paper cites.
Maximal correlation coefficient (non-symmetric case)
O. V. Sarmanov · 1958
Earlier work this paper cites.
Information Theory
Robert B. Ash · 1965
Earlier work this paper cites.
Information-type measures of difference of probability distributions and indirect observation
I. Csiszár · 1967
Earlier work this paper cites.
Definition of random variables by conditional distributions
R. L. Dobrushin · 1970
Earlier work this paper cites.
Information flow in graphs
DA Dawson · 1975
Earlier work this paper cites.
Spreading of sets in product spaces and hypercontraction of the Markov operator
R. Ahlswede and P. Gács · 1976
Earlier work this paper cites.
The theory of error correcting codes
Florence Jessie MacWilliams and Neil James Alexander Sloane · 1977
Earlier work this paper cites.
Maximal coupling
Sheldon Goldstein · 1979
Earlier work this paper cites.
Information Theory: Coding Theorems for Discrete Memoryless Systems
I. Csiszár and J. Körner · 1981
Earlier work this paper cites.
Relative entropy under mappings by stochastic matrices
J.E. Cohen, Yoh Iwasa, Gh. Rautu, M.B. Ruskai, E. Seneta, and Gh. Zbaganu · 1993
Earlier work this paper cites.
Equivalence of certain entropy contraction coefficients
M. Choi, M.B. Ruskai, and E. Seneta · 1994
Cited alongside, same era.
Graphical Models
Steffen L Lauritzen · 1996
Cited alongside, same era.
A non-Shannon-type conditional inequality of information quantities
Zhen Zhang and Raymond W Yeung · 1997
Cited alongside, same era.
Tractable inference for complex stochastic processes
Xavier Boyen and Daphne Koller · 1998
Cited alongside, same era.
Comparisons of Stochastic Matrices with Applications in Information Theory, Statistics, Economics and Population
J. E. Cohen, J. H. B. Kempermann, and Gh. Zbăganu · 1998
Cited alongside, same era.
The efficiency of investment information
Elza Erkip and Thomas M. Cover · 1998
Cited alongside, same era.
Two Problems in Multiterminal Information Theory
T. Courtade · 2012
Later among the works it cites.
Venkat Anantharam, Amin Gohari, Sudeep Kamath, and Chandra Nair · 2013
Later among the works it cites.
Local privacy and statistical minimax rates
John C Duchi, Michael Jordan, and Martin J Wainwright · 2013
Later among the works it cites.
Logarithmic Sobolev inequalities and strong data processing theorems for discrete channels
Maxim Raginsky · 2013
Later among the works it cites.
Equivalent formulations of hypercontractivity using information measures
C. Nair · 2014
Later among the works it cites.
Strong data processing inequalities and ϕ \phi -sobolev inequalities for discrete channels
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Signal propagation and noisy circuits
William S Evans and Leonard J Schulman · 1999
Cited alongside, same era.
Concentration of measure and logarithmic Sobolev inequalities
M. Ledoux · 1999
Cited alongside, same era.
Broadcasting on trees and the Ising model
William Evans, Claire Kenyon, Yuval Peres, and Leonard J Schulman · 2000
Cited alongside, same era.
On contraction properties of Markov kernels
P. Del Moral, M. Ledoux, and L. Miclo · 2003
Cited alongside, same era.
Topics in optimal transportation
C. Villani · 2003
Cited alongside, same era.
On metric divergences of probability measures
I. Vajda · 2009
Cited alongside, same era.
Maxim Raginsky · 2014
Later among the works it cites.
Strong data processing inequalities for input-constrained additive noise channels
F. Calmon, Y. Polyanskiy, and Y. Wu · 2015
Closest in time.
Secret key generation with one communicator and a zero-rate one-shot via hypercontractivity
Jingbo Liu, Paul Cuff, and Sergio Verdu · 2015
Closest in time.
Bounds between contraction coefficients
Anuran Makur and Lizhong Zheng · 2015
Closest in time.
On the entropy of a noisy function
Alex Samorodnitsky · 2015
Closest in time.
Converses for distributed estimation via strong data processing inequalities
Aolin Xu and Maxim Raginsky · 2015
Closest in time.
Novel lower bounds on the entropy rate of binary hidden Markov processes
Or Ordentlich · 2016
Closest in time.
Lecture notes on information theory
Y. Polyanskiy and Y. Wu · 2016
Closest in time.
Dissipation of information in channels with input constraints
Yury Polyanskiy and Yihong Wu · 2016
Closest in time.