IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0031395.html
   My bibliography  Save this article

Recent Developments in Quantitative Graph Theory: Information Inequalities for Networks

Author

Listed:
  • Matthias Dehmer
  • Lavanya Sivakumar

Abstract

In this article, we tackle a challenging problem in quantitative graph theory. We establish relations between graph entropy measures representing the structural information content of networks. In particular, we prove formal relations between quantitative network measures based on Shannon's entropy to study the relatedness of those measures. In order to establish such information inequalities for graphs, we focus on graph entropy measures based on information functionals. To prove such relations, we use known graph classes whose instances have been proven useful in various scientific areas. Our results extend the foregoing work on information inequalities for graphs.

Suggested Citation

  • Matthias Dehmer & Lavanya Sivakumar, 2012. "Recent Developments in Quantitative Graph Theory: Information Inequalities for Networks," PLOS ONE, Public Library of Science, vol. 7(2), pages 1-13, February.
    • Handle: RePEc:plo:pone00:0031395
    DOI: 10.1371/journal.pone.0031395
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0031395
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0031395&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0031395?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zenil, Hector & Soler-Toscano, Fernando & Dingle, Kamaludin & Louis, Ard A., 2014. "Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 341-358.
    2. Lavanya Sivakumar & Matthias Dehmer, 2012. "Towards Information Inequalities for Generalized Graph Entropies," PLOS ONE, Public Library of Science, vol. 7(6), pages 1-14, June.

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0031395. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.