Fetching the paper…
Reading the bibliography…
The noisiness of a channel can be measured by comparing suitable functionals of the input and output distributions.
R. L. Dobrushin, “Central limit theorems for nonstationary Markov chains, I,” Theory Probab. Appl. , vol. 1, pp. 65–80, 1956
1956
Earlier work this paper cites.
——, “Central limit theorems for nonstationary Markov chains, II,” Theory Probab. Appl. , vol. 1, pp. 365–425, 1956
1956
Earlier work this paper cites.
O. V. Sarmanov, “Maximal coefficient of correlation (nonsymmetric case),” Doklady Akad. Nauk SSSR , vol. 121, no. 1, pp. 52–55, 1958
1958
Earlier work this paper cites.
M. H. DeGroot, “Uncertainty, information, and sequential experiments,” Ann. Math. Statist. , vol. 33, no. 2, pp. 404–419, 1962
1962
Earlier work this paper cites.
I. Csiszár, “Information-type measures of difference of probability distributions and indirect observations,” Stud. Sci. Math. Hung. , vol. 2, pp. 299–318, 1967
1967
Earlier work this paper cites.
H. S. Witsenhausen, “On sequences of pairs of dependent random variables,” SIAM J. Appl. Math. , vol. 28, no. 1, pp. 100–113, January 1975
1975
Earlier work this paper cites.
A. D. Wyner, “The common information of two dependent random variables,” IEEE Trans. Inform. Theory , vol. 21, no. 2, pp. 163–179, March 1975
1975
Earlier work this paper cites.
R. Ahlswede and P. Gács, “Spreading of sets in product spaces and hypercontraction of the Markov operator,” Ann. Probab. , vol. 4, no. 6, pp. 925–939, 1976
1976
Earlier work this paper cites.
B. Efron and C. Stein, “The jackknife estimate of variance,” Ann. Statist. , vol. 9, pp. 586–596, 1981
1981
Earlier work this paper cites.
L. Le Cam, Asymptotic Methods in Statistical Decision Theory . Springer, 1986
1986
Earlier work this paper cites.
J. M. Steele, “An Efron–Stein inequality for nonsymmetric statistics,” Ann. Statist. , vol. 14, pp. 753–758, 1986
1986
Earlier work this paper cites.
K. Marton, “A simple proof of the blowing up lemma,” IEEE Trans. Inform. Theory , vol. 32, no. 3, pp. 445–446, 1986
1986
Earlier work this paper cites.
R. L. Dobrushin and S. B. Shlosman, “Completely analytical interactions: constructive description,” J. Stat. Phys. , vol. 46, no. 5/6, pp. 983–1014, 1987
1987
Earlier work this paper cites.
J. E. Cohen, Y. Iwasa, G. Rautu, M. B. Ruskai, E. Seneta, and G. Zbǎganu, “Relative entropy under mappings by stochastic matrices,” Lin. Algebra Appl. , vol. 179, pp. 211–235, 1993
1993
Earlier work this paper cites.
M. Choi, M. B. Ruskai, and E. Seneta, “Equivalence of certain entropy contraction coefficients,” Lin. Algebra Appl. , vol. 208/209, pp. 29–36, 1994
1994
Earlier work this paper cites.
D. Bakry, “L’hypercontractivité et son utilisation en théorie des semigroupes,” in Lectures on Probability Theory . Springer, 1994, vol. 1581, pp. 1–114
1994
Earlier work this paper cites.
P. Diaconis and L. Saloff-Coste, “Logarithmic Sobolev inequalities for finite Markov chains,” Ann. Appl. Probab. , vol. 6, no. 3, pp. 695–750, 1996
1996
Earlier work this paper cites.
W. R. Gilks, S. Richardson, and D. Spiegelhalter, Eds., Markov Chain Monte Carlo in Practice . Chapman & Hall, 1996
1996
Earlier work this paper cites.
——, “Bounding d ¯ \bar{d} -distance by informational divergence: a method to prove measure concentration,” Ann. Probab. , vol. 24, no. 2, pp. 857–866, 1996
1996
Earlier work this paper cites.
L. Miclo, “Remarques sur l’hypercontractivité et l’évolution de l’entropie pour des chaînes de Markov finies,” Séminaire de probabilités (Strasbourg) , vol. 31, pp. 136–167, 1997
1997
Earlier work this paper cites.
R. Bhatia, Matrix Analysis . New York: Springer, 1997
1997
Earlier work this paper cites.
J. E. Cohen, J. H. B. Kemperman, and G. Zbǎganu, Comparisons of Stochastic Matrices, With Applications in Information Theory, Statistics, Economics, and Population Sciences . Boston: Birkhäuser, 1998
1998
Earlier work this paper cites.
X. Boyen and D. Koller, “Tractable inference for complex stochastic processes,” in Proc. 14th Annual Conf. on Uncertainty in Artif. Intel. , Madison, WI, July 1998, pp. 33–42
1998
Earlier work this paper cites.
E. Erkip and T. M. Cover, “The efficiency of investment information,” IEEE Trans. Inform. Theory , vol. 44, no. 3, pp. 1026–1040, May 1998
1998
Earlier work this paper cites.
S. G. Bobkov and F. Götze, “Exponential integrability and transportation cost related to logarithmic Sobolev inequalities,” J. Funct. Anal. , vol. 163, pp. 1–28, 1999
1999
Cited alongside, same era.
R. Latała and K. Oleszkiewicz, “Between Sobolev and Poincaré,” in Geometric Aspects of Functional Analysis , ser. Lecture Notes in Mathematics. Springer, 2000, vol. 1745, pp. 147–168
2000
Cited alongside, same era.
L. Györfi and I. Vajda, “A class of modified Pearson and Neyman statistics,” Statistics and Decisions , vol. 19, no. 3, pp. 239–252, 2001
2001
Cited alongside, same era.
J. Hiriart-Urruty and C. Lemaréchal, Fundamentals of Convex Analysis . Berlin: Springer, 2001
2001
Cited alongside, same era.
M. Ledoux, The Concentration of Measure Phenomenon . Amer. Math. Soc., 2001
2001
Cited alongside, same era.
G. Grimmett, The Random Cluster Model . Berlin: Springer, 2006
2006
Later among the works it cites.
A. Montanari and N. Gerschenfeld, “Reconstruction for models on random graphs,” in Proc. 48th IEEE Symp. on Foundations of Comp. Sci. , 2007, pp. 194–204
2007
Later among the works it cites.
D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times . Amer. Math. Soc., 2008
2008
Later among the works it cites.
D. P. Palomar and S. Verdú, “Lautum information,” IEEE Trans. Inform. Theory , vol. 54, no. 3, pp. 964–975, March 2008
2008
Later among the works it cites.
M. J. Wainwright and M. I. Jordan, “Graphical models, exponential families, and variational inference,” Foundations and Trends in Machine Learning , vol. 1, no. 1-2, pp. 1–305, December 2008
2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Houdré and P. Tetali, “Concentration of measure for products of Markov kernels and graph products via functional inequalities,” Comb. Probab. Comput. , vol. 10, pp. 1–28, 2001
2001
Cited alongside, same era.
P. Del Moral, M. Ledoux, and L. Miclo, “On contraction properties of Markov kernels,” Prob. Theory Rel. Fields , vol. 126, pp. 395–420, 2003
2003
Cited alongside, same era.
C. Villani, Topics in Optimal Transportation , ser. Graduate Studies in Mathematics. Providence, RI: Amer. Math. Soc., 2003, vol. 58
2003
Cited alongside, same era.
M. Jerrum, Counting, Sampling, and Integrating: Algorithms and Complexity . Birkhäuser, 2003
2003
Cited alongside, same era.
G. Winkler, Image Analysis, Random Fields, and Markov Chain Monte Carlo Methods: A Mathematical Introduction , 2nd ed. Springer, 2003
2003
Cited alongside, same era.
D. Chafaï, “Entropies, convexity, and functional inequalities: on Φ \Phi -entropies and Φ \Phi -Sobolev inequalities,” J. Math. Kyoto Univ. , vol. 44, no. 2, pp. 325–363, 2004
2004
Cited alongside, same era.
C. P. Robert and G. Casella, Monte Carlo Statistical Methods , 2nd ed. Springer, 2004
2004
Cited alongside, same era.
X. Nguyen, M. J. Wainwright, and M. I. Jordan, “On surrogate loss functions and f f -divergences,” Ann. Statist. , vol. 37, no. 2, pp. 876–904, 2009
2009
Later among the works it cites.
P. Diaconis, K. Khare, and L. Saloff-Coste, “Stochastic alternating projections,” Illinois J. Math. , vol. 54, no. 3, pp. 963–979, 2010
2010
Later among the works it cites.
N. Bhatnagar, J. Vera, E. Vigoda, and D. Weitz, “Reconstruction for colorings on trees,” SIAM J. Discrete Math. , vol. 25, no. 2, pp. 809–826, 2011
2011
Later among the works it cites.
S. Kamath and V. Anantharam, “Non-interactive simulation of joint distributions: The Hirschfeld–Gebelein–Rényi maximal correlation and the hypercontractivity ribbon,” in Proc. 50th Annu. Allerton Conf. on Commun., Control, and Comput. , Monticello, IL, October 2012
2012
Later among the works it cites.
C. Borgs, J. T. Chayes, and P. Tetali, “Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point,” Prob. Theory Rel. Fields , vol. 152, pp. 509–557, 2012
2012
Later among the works it cites.
M. Ullrich, “Comparison of Swendsen-Wang and heat-bath dynamics,” Random Struct. Alg. , vol. 42, pp. 520–535, 2012
2012
Later among the works it cites.
2013
Later among the works it cites.
T. Courtade, “Outer bounds for multiterminal source coding via a strong data processing inequality,” in Proc. Int. IEEE Symp. on Inform. Theory , Istanbul, Turkey, July 2013, pp. 559–563
2013
Later among the works it cites.
M. Raginsky, “Logarithmic Sobolev inequalities and strong data processing theorems for discrete channels,” in Proc. Int. IEEE Symp. on Inform. Theory , Istanbul, Turkey, July 2013, pp. 419–423
2013
Later among the works it cites.
E. Mossel, K. Oleszkiewicz, and A. Sen, “On reverse hypercontractivity,” Geom. Funct. Anal. , vol. 23, no. 3, pp. 1062–1097, 2013
2013
Later among the works it cites.
S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence . Oxford Univ. Press, 2013
2013
Later among the works it cites.
F. Hansen, “The fast track to Loewner’s theorem,” Lin. Algebra Appl. , vol. 438, pp. 4557–4571, 2013
2013
Later among the works it cites.
V. Anantharam, A. Gohari, S. Kamath, and C. Nair, “On hypercontractivity and a data processing inequality,” in Proc. Int. IEEE Symp. on Inform. Theory , Honolulu, HI, July 2014, pp. 3022–3026
2014
Closest in time.
J. Liu, P. Cuff, and S. Verdú, “Key capacity with limited one-way communication for product sources,” in Proc. IEEE Int. Symp. Inform. Theory , Honolulu, HI, July 2014, pp. 1146–1150
2014
Closest in time.
M. Raginsky and I. Sason, Concentration of Measure Inequalities in Information Theory, Communications, and Coding , 2nd ed. Now Publishers, 2014
2014
Closest in time.
2015
Closest in time.
2015
Closest in time.
Y. Polyanskiy and Y. Wu, “Dissipation of information in channels with input constraints,” IEEE Trans. Inform. Theory , vol. 62, no. 1, pp. 35–55, January 2016
2016
Closest in time.