{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:18:15Z","timestamp":1774678695259,"version":"3.50.1"},"reference-count":40,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2020,6,26]],"date-time":"2020-06-26T00:00:00Z","timestamp":1593129600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This work is an extension of our earlier article, where a well-known integral representation of the logarithmic function was explored and was accompanied with demonstrations of its usefulness in obtaining compact, easily-calculable, exact formulas for quantities that involve expectations of the logarithm of a positive random variable. Here, in the same spirit, we derive an exact integral representation (in one or two dimensions) of the moment of a nonnegative random variable, or the sum of such independent random variables, where the moment order is a general positive non-integer real (also known as fractional moments). The proposed formula is applied to a variety of examples with an information-theoretic motivation, and it is shown how it facilitates their numerical evaluations. In particular, when applied to the calculation of a moment of the sum of a large number, n, of nonnegative random variables, it is clear that integration over one or two dimensions, as suggested by our proposed integral representation, is significantly easier than the alternative of integrating over n dimensions, as needed in the direct calculation of the desired moment.<\/jats:p>","DOI":"10.3390\/e22060707","type":"journal-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T03:40:07Z","timestamp":1593402007000},"page":"707","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Some Useful Integral Representations for Information-Theoretic Analyses"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9547-3243","authenticated-orcid":false,"given":"Neri","family":"Merhav","sequence":"first","affiliation":[{"name":"The Andrew and Erna Viterbi Faculty of Electrical Engineering, Israel Institute of Technology Technion City, Haifa 3200003, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5681-1273","authenticated-orcid":false,"given":"Igal","family":"Sason","sequence":"additional","affiliation":[{"name":"The Andrew and Erna Viterbi Faculty of Electrical Engineering, Israel Institute of Technology Technion City, Haifa 3200003, Israel"}]}],"member":"1968","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Dong, A., Zhang, H., Wu, D., and Yuan, D. (2015). Logarithmic expectation of the sum of exponential random variables for wireless communication performance evaluation. 2015 IEEE 82nd Vehicular Technology Conference (VTC2015-Fall), IEEE.","DOI":"10.1109\/VTCFall.2015.7391010"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/1030059","article-title":"The entropy of a Poisson distribution","volume":"30","author":"Appledorn","year":"1988","journal-title":"SIAM Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0893-9659(98)00013-5","article-title":"Integral representations and asymptotic expansions for Shannon and R\u00e9nyi entropies","volume":"11","author":"Knessl","year":"1998","journal-title":"Appl. Math. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2426","DOI":"10.1109\/TIT.2003.817449","article-title":"Capacity bounds via duality with applications to multiple-antenna systems on flat fading channels","volume":"49","author":"Lapidoth","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1364\/JOSAB.24.000739","article-title":"Spectral efficiency of optical direct detection","volume":"24","author":"Martinez","year":"2007","journal-title":"J. Opt. Soc. Am. B"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Merhav, N., and Sason, I. (2020). An integral representation of the logarithmic function with applications in information theory. Entropy, 22.","DOI":"10.3390\/e22060707"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1109\/TIT.2015.2400432","article-title":"Stochastic ordering of fading channels through the Shannon transform","volume":"61","author":"Rajan","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","first-page":"288","article-title":"Expected logarithm of central quadratic form and its use in KL-divergence of some distributions","volume":"18","author":"Zadeh","year":"2016","journal-title":"Entropy"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/18.481781","article-title":"An inequality on guessing and its application to sequential decoding","volume":"42","author":"Arikan","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/18.669158","article-title":"Guessing subject to distortion","volume":"44","author":"Arikan","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1109\/18.705557","article-title":"Joint source-channel coding and guessing with application to sequential decoding","volume":"44","author":"Arikan","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2062","DOI":"10.1109\/18.641578","article-title":"Comments on \u201cAn inequality on guessing and its application to sequential decoding\u201d","volume":"43","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"6975","DOI":"10.1109\/TIT.2019.2933000","article-title":"Guessing attacks on distributed-storage systems","volume":"65","author":"Bracher","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"5065","DOI":"10.1109\/TIT.2014.2329490","article-title":"Encoding tasks and R\u00e9nyi entropy","volume":"60","author":"Bunte","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0019-9958(65)90332-3","article-title":"A coding theorem and R\u00e9nyi\u2019s entropy","volume":"8","author":"Campbell","year":"1965","journal-title":"Inf. Control"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Courtade, T., and Verd\u00fa, S. (July, January 29). Cumulant generating function of codeword lengths in optimal lossless compression. Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6875283"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Courtade, T., and Verd\u00fa, S. (July, January 29). Variable-length lossy compression and channel coding: Non-asymptotic converses via cumulant generating functions. Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6875284"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"7636","DOI":"10.1109\/TIT.2018.2865919","article-title":"Lower bounds on exponential moments of the quadratic error in parameter estimation","volume":"64","author":"Merhav","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"4323","DOI":"10.1109\/TIT.2018.2803162","article-title":"Improved bounds on lossless source coding and guessing moments via R\u00e9nyi measures","volume":"64","author":"Sason","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Sason, I. (2018). Tight bounds on the R\u00e9nyi entropy via majorization with applications to guessing and compression. Entropy, 20.","DOI":"10.3390\/e20120896"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TIT.2006.887466","article-title":"Guessing under source uncertainty","volume":"53","author":"Sundaresan","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Sundaresan, R. (2007, January 24\u201329). Guessing based on length functions. Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France.","DOI":"10.1109\/ISIT.2007.4557309"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"M\u00e9zard, M., and Montanari, A. (2009). Information, Physics, and Computation, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1103\/PhysRevE.48.1046","article-title":"Interface growth and Burgers turbulence: The problem of random initial conditions","volume":"48","author":"Esipov","year":"1993","journal-title":"Phys. Rev. E"},{"key":"ref_25","unstructured":"Song, J., Still, S., Rojas, R.D.H., Castillo, I.P., and Marsili, M. (2019). Optimal work extraction and mutual information in a generalized Szil\u00e1rd engine. arXiv."},{"key":"ref_26","unstructured":"Gradshteyn, I.S., and Ryzhik, I.M. (2014). Tables of Integrals, Series, and Products, Academic Press. [8th ed.]."},{"key":"ref_27","first-page":"3307","article-title":"Stieltjes moment problem and fractional moments","volume":"216","author":"Gzyl","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"ref_28","first-page":"2124","article-title":"Determination of the distribution of total loss from the fractional moments of its exponential","volume":"219","author":"Gzyl","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_29","first-page":"501","article-title":"On the proximity of distributions in terms of coinciding fractional moments","volume":"145","author":"Tagliani","year":"2003","journal-title":"Appl. Math. Comput."},{"key":"ref_30","first-page":"4423","article-title":"Hausdorff moment problem and fractional moments: A simplified procedure","volume":"218","author":"Tagliani","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"ref_31","unstructured":"Olver, F.W.J., Lozier, D.W., Boisvert, R.F., and Clark, C.W. (2010). NIST Handbook of Mathematical Functions, NIST and Cambridge University Press."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/TIT.2010.2090221","article-title":"Guessing revisited: A large deviations approach","volume":"57","author":"Hanawal","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/TIT.2019.2920538","article-title":"Universal randomized guessing with application to asynchronous decentralized brute-force attacks","volume":"66","author":"Merhav","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2288","DOI":"10.1109\/TIFS.2019.2895955","article-title":"Why botnets work: Distributed brute-force attacks need no synchronization","volume":"14","author":"Salamatian","year":"2019","journal-title":"IEEE Trans. Inf. Foren. Sec."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"312989","DOI":"10.1155\/2010\/312989","article-title":"A generalized Cauchy distribution framework for problems requiring robust behavior","volume":"2010","author":"Carrillo","year":"2010","journal-title":"EURASIP J. Adv. Signal Process."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/s40488-016-0050-3","article-title":"The generalized Cauchy family of distributions with applications","volume":"3","author":"Alzaatreh","year":"2016","journal-title":"J. Stat. Distrib. App."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Marsiglietti, A., and Kostina, V. (2018). A lower bound on the differential entropy of log-concave random vectors with applications. Entropy, 20.","DOI":"10.3390\/e20030185"},{"key":"ref_38","unstructured":"R\u00e9nyi, A. (1961, January 8\u20139). On measures of entropy and information. Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, USA."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1214\/ECP.v18-2359","article-title":"On the concentration of the missing mass","volume":"18","author":"Berend","year":"2013","journal-title":"Electron. Commun. Probab."},{"key":"ref_40","unstructured":"Raginsky, M., and Sason, I. (2019). Concentration of Measure Inequalities in Information Theory, Communications and Coding. Foundations and Trends in Communications and Information Theory, NOW Publishers. [3rd ed.]."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/6\/707\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:43:27Z","timestamp":1760175807000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/6\/707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,26]]},"references-count":40,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2020,6]]}},"alternative-id":["e22060707"],"URL":"https:\/\/doi.org\/10.3390\/e22060707","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,26]]}}}