IDEAS home Printed from https://ideas.repec.org/a/gam/jstats/v3y2020i2p13-165d369599.html
   My bibliography  Save this article

Generalized Mutual Information

Author

Listed:
  • Zhiyi Zhang

    (Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, NC 28223, USA)

Abstract

Mutual information is one of the essential building blocks of information theory. It is however only finitely defined for distributions in a subclass of the general class of all distributions on a joint alphabet. The unboundedness of mutual information prevents its potential utility from being extended to the general class. This is in fact a void in the foundation of information theory that needs to be filled. This article proposes a family of generalized mutual information whose members are indexed by a positive integer n , with the n th member being the mutual information of n th order. The mutual information of the first order coincides with Shannon’s, which may or may not be finite. It is however established (a) that each mutual information of an order greater than 1 is finitely defined for all distributions of two random elements on a joint countable alphabet, and (b) that each and every member of the family enjoys all the utilities of a finite Shannon’s mutual information.

Suggested Citation

  • Zhiyi Zhang, 2020. "Generalized Mutual Information," Stats, MDPI, vol. 3(2), pages 1-8, June.
  • Handle: RePEc:gam:jstats:v:3:y:2020:i:2:p:13-165:d:369599
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2571-905X/3/2/13/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2571-905X/3/2/13/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. C. G. Chakrabarti & Indranil Chakrabarty, 2005. "Shannon entropy: axiomatic characterization and application," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2005, pages 1-8, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mikhail Gennadjevich Goryachev, 2015. "Finite Component Approach for Modelling Entropy of Motor Road Pavements to Assess Their Efficiency," Modern Applied Science, Canadian Center of Science and Education, vol. 9(8), pages 140-140, August.
    2. Jangho Yang, 2018. "Information Theoretic Approaches In Economics," Journal of Economic Surveys, Wiley Blackwell, vol. 32(3), pages 940-960, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jstats:v:3:y:2020:i:2:p:13-165:d:369599. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.