Fetching the paper…
Reading the bibliography…
During the last two decades, concentration inequalities have been the subject of exciting developments in various areas, including convex geometry, functional analysis, statistical physics, high-dimensional statistics, pure and applied probability theory, information theory, theoretical computer science, and learning theory.
S. N. Bernstein, The Theory of Probability . Moscow/Leningrad: Gos. Izdat., 1927, in Russian
1927
Earlier work this paper cites.
H. Chernoff, “A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations,” Annals of Mathematical Statistics , vol. 23, no. 4, pp. 493–507, 1952
1952
Earlier work this paper cites.
R. Salem and A. Zygmund, “Some properties of trigonometric series whose terms have random signs,” Acta Mathematica , vol. 91, no. 1, pp. 245–301, 1954
1954
Earlier work this paper cites.
A. J. Stam, “Some inequalities satisfied by the quantities of information of Fisher and Shannon,” Information and Control , vol. 2, pp. 101–112, 1959
1959
Earlier work this paper cites.
W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American Statistical Association , vol. 58, no. 301, pp. 13–30, March 1963
1963
Earlier work this paper cites.
R. G. Gallager, “Low-Density Parity-Check Codes,” Ph.D. dissertation, MIT, Cambridge, MA, USA, 1963
1963
Earlier work this paper cites.
U. Augustin, “Gedächtnisfreie Kanäle für diskrete Zeit,” Z. Wahrscheinlichkeitstheorie verw. Gebiete , vol. 6, pp. 10–61, 1966
1966
Earlier work this paper cites.
K. Azuma, “Weighted sums of certain dependent random variables,” Tohoku Mathematical Journal , vol. 19, pp. 357–367, 1967
1967
Earlier work this paper cites.
F. Topsøe, “An information theoretical identity and a problem involving capacity,” Studia Scientiarum Mathematicarum Hungarica , vol. 2, pp. 291–292, 1967
1967
Earlier work this paper cites.
H. L. van Trees, Detection, Estimation and Modulation Theory, Part I . Wiley, 1968
1968
Earlier work this paper cites.
P. Federbush, “A partially alternate derivation of a result of Nelson,” Journal of Mathematical Physics , vol. 10, no. 1, pp. 50–52, 1969
1969
Earlier work this paper cites.
T. M. Cover, “Broadcast channels,” IEEE Trans. on Information Theory , vol. 18, no. 1, pp. 2–14, January 1972
1972
Earlier work this paper cites.
P. P. Bergmans, “Random coding theorem for broadcast channels with degraded components,” IEEE Trans. on Information Theory , vol. 19, no. 2, pp. 197–207, March 1973
1973
Earlier work this paper cites.
A. D. Wyner, “A theorem on the entropy of certain binary sequences and applications: Part II,” IEEE Trans. on Information Theory , vol. 19, no. 6, pp. 772–777, March 1973
1973
Earlier work this paper cites.
G. Margulis, “Probabilistic characteristics of graphs with large connectivity,” Problems of Information Transmission , vol. 10, no. 2, pp. 174–179, 1974
1974
Earlier work this paper cites.
R. G. Gallager, “Capacity and coding for degraded broadcast channels,” Problems of Information Transmission , vol. 10, no. 3, pp. 3–14, July-September 1974
1974
Earlier work this paper cites.
J. H. B. Kemperman, “On the Shannon capacity of an arbitrary channel,” Indagationes Mathematicae , vol. 36, pp. 101–115, 1974
1974
Earlier work this paper cites.
L. Gross, “Logarithmic Sobolev inequalities,” American Journal of Mathematics , vol. 97, no. 4, pp. 1061–1083, 1975
1975
Earlier work this paper cites.
R. M. Gray, D. L. Neuhoff, and P. C. Shields, “A generalization of Ornstein’s d ¯ \bar{d} distance with applications to information theory,” Annals of Probability , vol. 3, no. 2, pp. 315–328, 1975
1975
Earlier work this paper cites.
R. M. Gray, D. L. Neuhoff, and J. K. Omura, “Process definitions of distortion-rate functions and source coding theorems,” IEEE Trans. on Information Theory , vol. 21, no. 5, pp. 524–532, September 1975
1975
Earlier work this paper cites.
R. Ahlswede and J. Körner, “Source coding with side information and a converse for degraded broadcast channels,” IEEE Trans. on Information Theory , vol. 21, no. 6, pp. 629–637, November 1975
1975
Earlier work this paper cites.
R. Ahlswede and G. Dueck, “Every bad code has a good subcode: a local converse to the coding theorem,” Z. Wahrscheinlichkeitstheorie verw. Gebiete , vol. 34, pp. 179–182, 1976
1976
Earlier work this paper cites.
R. Ahlswede, P. Gács, and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication,” Z. Wahrscheinlichkeitstheorie verw. Gebiete , vol. 34, pp. 157–177, 1976, see correction in vol. 39, no. 4, pp. 353–354, 1977
1977
Earlier work this paper cites.
G. Dueck, “Maximal error capacity regions are smaller than average error capacity regions for multi-user channels,” Problems of Control and Information Theory , vol. 7, no. 1, pp. 11–19, 1978
1978
Earlier work this paper cites.
R. A. Adams and F. H. Clarke, “Gross’s logarithmic Sobolev inequality: a simple proof,” American Journal of Mathematics , vol. 101, no. 6, pp. 1265–1269, December 1979
1979
Earlier work this paper cites.
B. Efron and C. Stein, “The jackknife estimate of variance,” Annals of Statistics , vol. 9, pp. 586–596, 1981
1981
Earlier work this paper cites.
R. Ahlswede, “An elementary proof of the strong converse theorem for the multiple-access channel,” Journal of Combinatorics, Information and System Sciences , vol. 7, no. 3, pp. 216–230, 1982
1982
Earlier work this paper cites.
E. B. Davies and B. Simon, “Ultracontractivity and the heat kernel for Schrödinger operators and Dirichlet Laplacians,” Journal of Functional Analysis , vol. 59, no. 335-395, 1984
1984
Earlier work this paper cites.
M. H. M. Costa and T. M. Cover, “On the similarity of the entropy power inequality and the Brunn–Minkowski inequality,” IEEE Trans. on Information Theory , vol. 30, no. 6, pp. 837–839, November 1984
1984
Earlier work this paper cites.
I. Csiszár, “Sanov property, generalized I I -projection and a conditional limit theorem,” Annals of Probability , vol. 12, no. 3, pp. 768–793, 1984
1984
Earlier work this paper cites.
M. H. M. Costa, “A new entropy power inequality,” IEEE Trans. on Information Theory , vol. 31, no. 6, pp. 751–760, November 1985
1985
Earlier work this paper cites.
D. Bakry and M. Emery, “Diffusions hypercontractives,” in Séminaire de Probabilités XIX , ser. Lecture Notes in Mathematics. Springer, 1985, vol. 1123, pp. 177–206
1985
Earlier work this paper cites.
R. L. Dobrushin and S. B. Shlosman, “Completely analytical Gibbs fields,” in Statistical Physics and Dynamical Systems . Springer, 1985, pp. 371–403
1985
Earlier work this paper cites.
K. Marton, “A simple proof of the blowing-up lemma,” IEEE Trans. on Information Theory , vol. 32, no. 3, pp. 445–446, May 1986
1986
Earlier work this paper cites.
J. M. Steele, “An Efron–Stein inequality for nonsymmetric statistics,” Annals of Statistics , vol. 14, pp. 753–758, 1986
1986
Earlier work this paper cites.
E. Shamir and J. Spencer, “Sharp concentration of the chromatic number on random graphs,” Combinatorica , vol. 7, no. 1, pp. 121–129, 1987
1987
Earlier work this paper cites.
I. Karatzas and S. Shreve, Brownian Motion and Stochastic Calculus , 2nd ed. Springer, 1988
1988
Earlier work this paper cites.
——, “On the method of bounded differences,” in Surveys in Combinatorics . Cambridge University Press, 1989, vol. 141, pp. 148–188
1989
Earlier work this paper cites.
F. M. J. Willems, “The maximal-error and average-error capacity regions of the broadcast channel are identical: a direct proof,” Problems of Control and Information Theory , vol. 19, no. 4, pp. 339–347, 1990
1990
Earlier work this paper cites.
A. Dembo, T. M. Cover, and J. A. Thomas, “Information theoretic inequalities,” IEEE Trans. on Information Theory , vol. 37, no. 6, pp. 1501–1518, November 1991
1991
Earlier work this paper cites.
E. A. Carlen, “Superadditivity of Fisher’s information and logarithmic Sobolev inequalities,” Journal of Functional Analysis , vol. 101, pp. 194–211, 1991
1991
Earlier work this paper cites.
L. C. Evans and R. F. Gariepy, Measure Theory and Fine Properties of Functions . CRC Press, 1992
1992
Earlier work this paper cites.
M. C. Mackey, Time’s Arrow: The Origins of Thermodynamic Behavior . New York: Springer, 1992
1992
Earlier work this paper cites.
T. S. Han and S. Verdú, “Approximation theory of output statistics,” IEEE Trans. on Information Theory , vol. 39, no. 3, pp. 752–772, May 1993
1993
Earlier work this paper cites.
M. Talagrand, “Concentration of measure and isoperimteric inequalities in product space,” Publications Mathématiques de l’I.H.E.S , vol. 81, pp. 73–205, 1995
1995
Earlier work this paper cites.
P. Billingsley, Probability and Measure , 3rd ed. Wiley Series in Probability and Mathematical Statistics, 1995
1995
Earlier work this paper cites.
J. Douillard, M. Jezequel, C. Berrou, A. Picart, P. Didier, and A. Glavieux, “Iterative correction of intersymbol interference: turbo-equalization,” European Transactions on Telecommunications , vol. 6, no. 1, pp. 507–511, September 1995
1995
Earlier work this paper cites.
M. Talagrand, “A new look at independence,” Annals of Probability , vol. 24, no. 1, pp. 1–34, January 1996
1996
Earlier work this paper cites.
M. Sipser and D. A. Spielman, “Expander codes,” IEEE Trans. on Information Theory , vol. 42, no. 6, pp. 1710–1722, November 1996
1996
Earlier work this paper cites.
K. Marton, “Bounding d ¯ \bar{d} -distance by informational divergence: a method to prove measure concentration,” Annals of Probability , vol. 24, no. 2, pp. 857–866, 1996
1996
Earlier work this paper cites.
A. Dembo and O. Zeitouni, “Transportation approach to some concentration inequalities in product spaces,” Electronic Communications in Probability , vol. 1, pp. 83–90, 1996
1996
Earlier work this paper cites.
Y. Steinberg and S. Verdú, “Simulation of random processes and rate-distortion theory,” IEEE Trans. on Information Theory , vol. 42, no. 1, pp. 63–86, January 1996
1996
Earlier work this paper cites.
A. W. van der Vaart and J. A. Wellner, Weak Convergence and Empirical Processes . Springer, 1996
1996
Earlier work this paper cites.
S. Bobkov, “A functional form of the isoperimetric inequality for the Gaussian measure,” Journal of Functional Analysis , vol. 135, pp. 39–49, 1996
1996
Earlier work this paper cites.
M. Talagrand, “Transportation cost for Gaussian and other product measures,” Geometry and Functional Analysis , vol. 6, no. 3, pp. 587–600, 1996
1996
Earlier work this paper cites.
J. M. Steele, Probability Theory and Combinatorial Optimization , ser. CBMS–NSF Regional Conference Series in Applied Mathematics. Siam, Philadelphia, PA, USA, 1997, vol. 69
1997
Earlier work this paper cites.
A. Dembo, “Information inequalities and concentration of measure,” Annals of Probability , vol. 25, no. 2, pp. 927–939, 1997
1997
Earlier work this paper cites.
M. Ledoux, “On Talagrand’s deviation inequalities for product measures,” ESAIM: Probability and Statistics , vol. 1, pp. 63–87, 1997
1997
Earlier work this paper cites.
A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications , 2nd ed. Springer, 1997
1997
Earlier work this paper cites.
C. McDiarmid, “Centering sequences with bounded differences,” Combinatorics, Probability and Computing , vol. 6, no. 1, pp. 79–86, March 1997
1997
Earlier work this paper cites.
P. Dupuis and R. S. Ellis, A Weak Convergence Approach to the Theory of Large Deviations . New York: Wiley Series in Probability and Statistics, 1997
1997
Earlier work this paper cites.
K. Marton, “A measure concentration inequality for contracting Markov chains,” Geometric and Functional Analysis , vol. 6, pp. 556–571, 1996, see also erratum in Geometric and Functional Analysis
1997
Earlier work this paper cites.
S. Shamai and S. Verdú, “The empirical distribution of good codes,” IEEE Trans. on Information Theory , vol. 43, no. 3, pp. 836–846, May 1997
1997
Earlier work this paper cites.
C. McDiarmid, “Concentration,” in Probabilistic Methods for Algorithmic Discrete Mathematics . Springer, 1998, pp. 195–248
1998
Earlier work this paper cites.
S. G. Bobkov and M. Ledoux, “On modified logarithmic Sobolev inequalities for Bernoulli and Poisson measures,” Journal of Functional Analysis , vol. 156, no. 2, pp. 347–365, 1998
1998
Cited alongside, same era.
S. Verdú, Multiuser Detection . Cambridge University Press, 1998
1998
Cited alongside, same era.
M. J. Kearns and L. K. Saul, “Large deviation methods for approximate probabilistic inference,” in Proceedings of the 14th Conference on Uncertaintly in Artifical Intelligence , San-Francisco, CA, USA, March 16-18 1998, pp. 311–319
1998
Cited alongside, same era.
A. P. Godbole and P. Hitczenko, “Beyond the method of bounded differences,” in DIMACS Series in Discrete Mathematics and Theoretical Computer Science . American Mathematical Society, 1998, vol. 41, pp. 43–58
1998
Cited alongside, same era.
B. Øksendal, Stochastic Differential Equations: An Introduction with Applications , 5th ed. Berlin: Springer, 1998
2008
Later among the works it cites.
G. Lugosi, “Concentration of measure inequalities - lecture notes,” 2009, available at http://www.econ.upf.edu/~lugosi/anu.pdf
2009
Later among the works it cites.
S. Kudekar, “Statistical physics methods for sparse graph codes,” Ph.D. dissertation, EPFL - Swiss Federal Institute of Technology, Lausanne, Switzeland, July 2009
2009
Later among the works it cites.
S. Kudekar and N. Macris, “Sharp bounds for optimal decoding of low-density parity-check codes,” IEEE Trans. on Information Theory , vol. 55, no. 10, pp. 4635–4650, October 2009
2009
Later among the works it cites.
C. P. Kitsos and N. K. Tavoularis, “Logarithmic Sobolev inequalities for information measures,” IEEE Trans. on Information Theory , vol. 55, no. 6, pp. 2554–2561, June 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1998
Cited alongside, same era.
M. Ledoux, “Concentration of measure and logarithmic Sobolev inequalities,” in Séminaire de Probabilités XXXIII , ser. Lecture Notes in Math. Springer, 1999, vol. 1709, pp. 120–216
1999
Cited alongside, same era.
S. G. Bobkov and F. Götze, “Exponential integrability and transportation cost related to logarithmic Sobolev inequalities,” Journal of Functional Analysis , vol. 163, pp. 1–28, 1999
1999
Cited alongside, same era.
T. Etzion, A. Trachtenberg, and A. Vardy, “Which codes have cycle-free Tanner graphs?” IEEE Trans. on Information Theory , vol. 45, no. 6, pp. 2173–2181, September 1999
1999
Cited alongside, same era.
C. Villani, “A short proof of the ‘concavity of entropy power’,” IEEE Trans. on Information Theory , vol. 46, no. 4, pp. 1695–1696, July 2000
2000
Cited alongside, same era.
A. Shokrollahi, “Capacity-achieving sequences,” in Volume in Mathematics and its Applications , vol. 123, 2000, pp. 153–166
2000
Cited alongside, same era.
F. Otto and C. Villani, “Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality,” Journal of Functional Analysis , vol. 173, no. 2, pp. 361–400, June 2000
2000
Cited alongside, same era.
P.-M. Samson, “Concentration of measure inequalities for Markov chains and ϕ \phi -mixing processes,” Annals of Probability , vol. 28, no. 1, pp. 416–461, 2000
2000
Cited alongside, same era.
2009
Later among the works it cites.
N. Gozlan, “A characterization of dimension free concentration in terms of transportation inequalities,” Annals of Probability , vol. 37, no. 6, pp. 2480–2498, 2009
2009
Later among the works it cites.
A. Amraoui, A. Montanari, T. Richardson, and R. Urbanke, “Finite-length scaling for iteratively decoded LDPC ensembles,” IEEE Trans. on Information Theory , vol. 55, no. 2, pp. 473–498, February 2009
2009
Later among the works it cites.
I. Sason, “On universal properties of capacity-approaching LDPC code ensembles,” IEEE Trans. on Information Theory , vol. 55, no. 7, pp. 2956–2990, July 2009
2009
Later among the works it cites.
K. Xenoulis and N. Kalouptsidis, “On the random coding exponent of nonlinear Gaussian channels,” in Proceedings of the 2009 IEEE International Workshop on Information Theory , Volos, Greece, June 2009, pp. 32–36
2009
Later among the works it cites.
G. Blower, Random Matrices: High Dimensional Phenomena , ser. London Mathematical Society Lecture Notes. Cambridge, U.K.: Cambridge University Press, 2009
2009
Later among the works it cites.
P. J. Huber and E. M. Ronchetti, Robust Statistics , 2nd ed. Wiley Series in Probability and Statistics, 2009
2009
Later among the works it cites.
N. Merhav, Statistical Physics and Information Theory , ser. Foundations and Trends in Communications and Information Theory
2009
Later among the works it cites.
2009
Later among the works it cites.
N. Gozlan and C. Leonard, “Transport inequalities: a survey,” Markov Processes and Related Fields , vol. 16, no. 4, pp. 635–736, 2010
2010
Later among the works it cites.
S. Chatterjee and P. S. Dey, “Applications of Stein’s method for concentration inequalities,” Annals of Probability , vol. 38, no. 6, pp. 2443–2485, June 2010
2010
Later among the works it cites.
S. B. Korada and N. Macris, “Tight bounds on the capacity of binary input random CDMA systems,” IEEE Trans. on Information Theory , vol. 56, no. 11, pp. 5590–5613, November 2010
2010
Later among the works it cites.
M. Talagrand, Mean Field Models for Spin Glasses . Springer-Verlag, 2010
2010
Later among the works it cites.
Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in finite blocklength regime,” IEEE Trans. on Information Theory , vol. 56, no. 5, pp. 2307–2359, May 2010
2010
Later among the works it cites.
S. Verdú, “Mismatched estimation and relative entropy,” IEEE Trans. on Information Theory , vol. 56, no. 8, pp. 3712–3720, August 2010
2010
Later among the works it cites.
——, “Correction to ‘Measure concentration for Euclidean distance in the case of dependent random variables’,” Annals of Probability , vol. 38, no. 1, pp. 439–442, 2010
2010
Later among the works it cites.
——, “Freedman’s inequality for matrix martingales,” Electronic Communications in Probability , vol. 16, pp. 262–270, March 2011
2011
Later among the works it cites.
N. Ross, “Fundamentals of Stein’s method,” Probability Surveys , vol. 8, pp. 210–293, 2011
2011
Later among the works it cites.
S. Ghosh and L. Goldstein, “Concentration of measure via size-bias coupling,” Probability Theory and Related Fields , vol. 149, pp. 271–278, February 2011
2011
Later among the works it cites.
——, “Applications of size-biased couplings for concentration of measures,” Electronic Communications in Probability , vol. 16, pp. 70–83, January 2011
2011
Later among the works it cites.
S. Bobkov and M. Madiman, “Concentration of the information in data with log-concave distributions,” Annals of Probability , vol. 39, no. 4, pp. 1528–1543, 2011
2011
Later among the works it cites.
——, “The entropy per coordinate of a random vector is highly constrained under convexity conditions,” IEEE Trans. on Information Theory , vol. 57, no. 8, pp. 4940–4954, August 2011
2011
Later among the works it cites.
S. G. From and A. W. Swift, “A refinement of Hoeffding’s inequality,” Journal of Statistical Computation and Simulation , pp. 1–7, December 2011
2011
Later among the works it cites.
I. Sason, “On the concentration of the crest factor for OFDM signals,” in Proceedings of the 8th International Symposium on Wireless Communication Systems (ISWCS ’11) , Aachen, Germany, November 2011, pp. 784–788
2011
Later among the works it cites.
I. Sason and R. Eshel, “On concentration of measures for LDPC code ensembles,” in Proceedings of the 2011 IEEE International Symposium on Information Theory , Saint Petersburg, Russia, August 2011, pp. 1273–1277
2011
Later among the works it cites.
Y. Wu, “A simple transportation-information inequality with applications to HWI inequalities, and predictive density estimation,” September 2011, technical Report
2011
Later among the works it cites.
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems , 2nd ed. Cambridge University Press, 2011
2011
Later among the works it cites.
A. El Gamal and Y. Kim, Network Information Theory . Cambridge University Press, 2011
2011
Later among the works it cites.
Y. Seldin, F. Laviolette, N. Cesa-Bianchi, J. Shawe-Taylor, and P. Auer, “PAC-Bayesian inequalities for martingales,” IEEE Trans. on Information Theory , vol. 58, no. 12, pp. 7086–7093, December 2012
2012
Closest in time.
J. A. Tropp, “User-friendly tail bounds for sums of random matrices,” Foundations of Computational Mathematics , vol. 12, no. 4, pp. 389–434, August 2012
2012
Closest in time.
E. Milman, “Properties of isoperimetric, functional and transport-entropy inequalities via concentration,” Probability Theory and Related Fields , vol. 152, pp. 475–507, 2012
2012
Closest in time.
T. Nozaki, K. Kasai, and K. Sakaniwa, “Analytical solution of covariance evolution for irregular LDPC codes,” IEEE Trans. on Information Theory , vol. 58, no. 7, pp. 4770–4780, July 2012
2012
Closest in time.
V. Kostina and S. Verdú, “Fixed-length lossy compression in the finite blocklength regime,” IEEE Trans. on Information Theory , vol. 58, no. 6, pp. 3309–3338, June 2012
2012
Closest in time.
W. Matthews, “A linear program for the finite block length converse of Polyanskiy-Poor-Verdú via nonsignaling codes,” IEEE Trans. on Information Theory , vol. 59, no. 12, pp. 7036–7044, December 2012
2012
Closest in time.
X. Fan, I. Grama, and Q. Liu, “Hoeffding’s inequality for supermartingales,” Stochastic Processes and their Applications , vol. 122, no. 10, pp. 3545–3559, October 2012
2012
Closest in time.
——, “Large deviation exponential inequalities for supermartingales,” Electronic Communications in Probability , vol. 17, no. 59, pp. 1–8, December 2012
2012
Closest in time.
R. Eshel, Aspects of Convex Optimization and Concentration in Coding . Technion - Israel Institute of Technology, Haifa, Israel, February 2012
2012
Closest in time.
K. Xenoulis, N. Kalouptsidis, and I. Sason, “New achievable rates for nonlinear Volterra channels via martingale inequalities,” in Proceedings of the 2012 IEEE International Workshop on Information Theory , MIT, Boston, MA, USA, July 2012, pp. 1430–1434
2012
Closest in time.
A. Maurer, “Thermodynamics and concentration,” Bernoulli , vol. 18, no. 2, pp. 434–454, 2012
2012
Closest in time.
S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities - A Nonasymptotic Theory of Independence . Oxford University Press, 2013
2013
Closest in time.
G. Toscani, “An information-theoretic proof of Nash’s inequality,” Rendiconti Lincei: Matematica e Applicazioni , vol. 24, no. 1, pp. 83–93, 2013
2013
Closest in time.
E. Rio, “On Mcdiarmid’s concentration inequality,” Electronic Communications in Probability , vol. 18, no. 44, pp. 1–11, 2013
2013
Closest in time.
D. Berend and A. Kontorovich, “On the concentration of the missing mass,” Electronic Communications in Probability , vol. 18, no. 3, pp. 1–7, January 2013
2013
Closest in time.
G. Wunder, R. F. H. Fischer, H. Boche, S. Litsyn, and J. S. No, “The PAPR problem in OFDM transmission: new directions for a long-lasting problem,” IEEE Signal Processing Magazine , vol. 30, no. 6, pp. 130–144, November 2013
2013
Closest in time.
I. Sason, “Improved lower bounds on the total variation distance and relative entropy for the Poisson approximation,” in Proceedings of the 2013 IEEE Information Theory and Applications (ITA) Workshop , San-Diego, California, USA, February 2013, pp. 1–4
2013
Closest in time.
——, “Improved lower bounds on the total variation distance for the Poisson approximation,” Statistics and Probability Letters , vol. 83, no. 10, pp. 2422–2431, October 2013
2013
Closest in time.
——, “An inequality for relative entropy and logarithmic Sobolev inequalities in Euclidean spaces,” Journal of Functional Analysis , vol. 264, no. 1, pp. 34–61, January 2013
2013
Closest in time.
M. Raginsky and I. Sason, “Refined bounds on the empirical distribution of good channel codes via concentration inequalities,” in Proceedings of the 2013 IEEE International Workshop on Information Theory , Istanbul, Turkey, July 2013, pp. 221–225
2013
Closest in time.
L. Goldstein and U. Işlak, “Concentration inequalities via zero bias coupling,” Statistics and Probability Letters , vol. 86, pp. 17–23, January 2014
2014
Closest in time.
L. Mackey, M. I. Jordan, R. Y. Chen, B. Farrell, and J. A. Tropp, “Matrix concentration inequalities via the method of exchangeable pairs,” Annals of Probability , vol. 10, no. 2, pp. 906–945, 2014
2014
Closest in time.
D. Paulin, “The convex distance inequality for dependent random variables, with applications to the stochastic travelling salesman and other problems,” Electronic Journal of Probability , vol. 19, no. 68, pp. 1–34, August 2014
2014
Closest in time.
E. Abbe and A. Montanari, “On the concentration of the number of solutions of random satisfiability formulas,” Random Structures and Algorithms , vol. 45, no. 3, pp. 362–382, October 2014
2014
Closest in time.
——, “Distance-divergence inequalities,” IEEE Information Theory Society Newsletter , vol. 64, no. 1, pp. 9–13, March 2014
2014
Closest in time.
Y. Altuǧ and A. B. Wagner, “Refinement of the sphere-packing bound: asymmetric channels,” IEEE Trans. on Information Theory , vol. 60, no. 3, pp. 1592–1614, March 2014
2014
Closest in time.
Y. Kontoyiannis and S. Verdú, “Optimal lossless data compression: non-asymptotics and asymptotics,” IEEE Trans. on Information Theory , vol. 60, no. 2, pp. 777–795, February 2014
2014
Closest in time.
J. Dedecker and X. Fan, “Deviation inequalities for separately Lipschitz functionals of iterated random variables,” Stochastic Processes and their Applications , accepted in August 2014, available at http://dx.doi.org/10.1016/j.spa.2014.08.001
2014
Closest in time.
T. van Erven and P. Harremoës, “Rényi divergence and Kullback-Leibler divergence,” IEEE Trans. on Information Theory , vol. 60, no. 7, pp. 3797–3820, July 2014
2014
Closest in time.
D. Berend, P. Harremoës, and A. Kontorovich, “Minimum KL-divergence on complements of L 1 {L}_{1} balls,” IEEE Trans. on Information Theory , vol. 60, no. 6, pp. 3172–3177, June 2014
2014
Closest in time.
Y. Polyanskiy and S. Verdú, “Empirical distribution of good channel codes with non-vanishing error probability,” IEEE Trans. on Information Theory , vol. 60, no. 1, pp. 5–21, January 2014
2014
Closest in time.