Recent developments in quantitative graph theory: information inequalities for networks.
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 ent...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2012-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC3280299?pdf=render |
| _version_ | 1818313102058323968 |
|---|---|
| author | Matthias Dehmer Lavanya Sivakumar |
| author_facet | Matthias Dehmer Lavanya Sivakumar |
| author_sort | Matthias Dehmer |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-13T08:28:24Z |
| format | Article |
| id | doaj.art-14cbb563331f4579950bec12123956e1 |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-12-13T08:28:24Z |
| publishDate | 2012-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-14cbb563331f4579950bec12123956e12022-12-21T23:53:50ZengPublic Library of Science (PLoS)PLoS ONE1932-62032012-01-0172e3139510.1371/journal.pone.0031395Recent developments in quantitative graph theory: information inequalities for networks.Matthias DehmerLavanya SivakumarIn 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.http://europepmc.org/articles/PMC3280299?pdf=render |
| spellingShingle | Matthias Dehmer Lavanya Sivakumar Recent developments in quantitative graph theory: information inequalities for networks. PLoS ONE |
| title | Recent developments in quantitative graph theory: information inequalities for networks. |
| title_full | Recent developments in quantitative graph theory: information inequalities for networks. |
| title_fullStr | Recent developments in quantitative graph theory: information inequalities for networks. |
| title_full_unstemmed | Recent developments in quantitative graph theory: information inequalities for networks. |
| title_short | Recent developments in quantitative graph theory: information inequalities for networks. |
| title_sort | recent developments in quantitative graph theory information inequalities for networks |
| url | http://europepmc.org/articles/PMC3280299?pdf=render |
| work_keys_str_mv | AT matthiasdehmer recentdevelopmentsinquantitativegraphtheoryinformationinequalitiesfornetworks AT lavanyasivakumar recentdevelopmentsinquantitativegraphtheoryinformationinequalitiesfornetworks |