Connections between classical and parametric network entropies

PLoS ONE

Volumn 6, Issue 1, 2011, Pages

  Dehmer, Matthias ^a   Mowshowitz, Abbe ^b   Emmert Streib, Frank ^c  

^a UNIVERSITY FOR HEALTH SCIENCES   (Austria)

^b City University of New York   (United States)

^c QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; CLASSIFICATION; ENTROPY; INFORMATION; MATHEMATICAL ANALYSIS; PARAMETRIC TEST; PROBABILITY; ALGORITHM; COMPUTER GRAPHICS; MATHEMATICAL COMPUTING;

ALGORITHMS; COMPUTER GRAPHICS; ENTROPY; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PROBABILITY;

EID: 79251580952     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0015733     Document Type: Article

References (45)

1. Anand K, Bianconi G (2009) Entropy measures for networks: Toward an information theory of complex topologies. Phys Rev E 80: 045102(R).
2. Dehmer M, Mowshowitz A (2010) A history of graph entropy measures. Information Sciences.
3. Solé RV, Valverde S (2004) Information theory of complex networks:On evolution and architectural constraints. In: Lecture Notes in Physics volume 650: 189-207.
4. Ulanowicz RE (2001) Information theory in ecology. Computers and Chemistry 25: 393-399.
5. Rashevsky N (1955) Life, information theory, and topology. Bull Math Biophys 17: 229-235.
6. Temkin O, Zeigarnik AV, Bonchev D (1996) Chemical Reaction Networks. A Graph-Theoretical Approach. CRC Press.
7. Emmert-Streib F, Dehmer M (2010) Networks for systems biology: Conceptual connection of data and function. IET Systems Biology, accepted.
8. Mazurie A, Bonchev D, Schwikowski B, Buck GA (2008) Phylogenetic distances are encoded in networks of interacting pathways. Bioinformatics 24: 2579-2585.
9. Krawitz P, Shmulevich I (2007) Entropy of complex relevant components of boolean networks. Phys Rev E 76: 036115.
10. Sanchirico A, Fiorentino M (2008) Scale-free networks as entropy competition. Phys Rev E 78: 046114.
11. Bonchev D (1983) Information Theoretic Indices for Characterization of Chemical Structures. Chichester: Research Studies Press.
12. Mowshowitz A (1968) Entropy and the complexity of the graphs I: An index of the relative complexity of a graph. Bull Math Biophys 30: 175-204.
13. Trucco E (1956) A note on the information content of graphs. Bull Math Biol 18: 129-135.
14. Bonchev D (2009) Information theoretic measures of complexity. In: Meyers R, ed. Encyclopedia of Complexity and System Science, Springer volume 5: 4820-4838.
15. Dehmer M, Varmuza K, Borgert S, Emmert-Streib F (2009) On entropy-based molecular descriptors: Statistical analysis of real and synthetic chemical structures. J Chem Inf Model 49: 1655-1663.
16. Emmert-Streib F, Dehmer M (2007) Information theoretic measures of UHG graphs with low computational complexity. Appl Math Comput 190: 1783-1794.
17. Kim J, Wilhelm T (2008) What is a complex graph? Physica A 387: 2637-2652.
18. Mehler A (2011) A quantitative graph model of social ontologies by example of Wikipedia. In: Dehmer M, Emmert-Streib F, Mehler A, eds. Towards an Information Theory of Complex Networks: Statistical Methods and Applications. Boston/Basel: Birkhäuser.
19. Shannon CE, Weaver W (1949) The Mathematical Theory of Communication. University of Illinois Press.
20. Mowshowitz A (1968) Entropy and the complexity of graphs IV: Entropy measures and graphical structure. Bull Math Biophys 30: 533-546.
21. Bonchev D (1979) Information indices for atoms and molecules. Commun Math Comp Chem 7: 65-113.
22. Bonchev D, Rouvray DH (2005) Complexity in Chemistry, Biology, and Ecology. Mathematical and Computational Chemistry. New York, NY, USA: Springer.
23. Dehmer M (2008) A novel method for measuring the structural information content of networks. Cybernetics and Systems 39: 825-843.
24. Skorobogatov VA, Dobrynin AA (1988) Metrical analysis of graphs. Commun Math Comp Chem 23: 105-155.
25. da F Costa L, Rodrigues F, Travieso G (2007) Characterization of complex networks: A survey of measurements. Advances in Physics 56: 167-242.
26. Bonchev D (2003) Complexity in Chemistry. Introduction and Fundamentals. Boca Raton, FL, USA: Taylor and Francis.
27. Bonchev D, Trinajstić N (1977) Information theory, distance matrix and molecular branching. J Chem Phys 67: 4517-4533.
28. Dehmer M, Mowshowitz A (2010) Inequalities for entropy-based measures of network information content. Applied Mathematics and Computation 215: 4263-4271.
29. Körner J (1973) Coding of an information source having ambiguous alphabet and the entropy of graphs. Transactions of the 6-th Prague Conference on Information Theory. pp 411-425.
30. Simonyi G (1995) Graph entropy: A survey. In: Cook W, Lova ́sz L, Seymour P, eds. Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science volume 20: 399-441.
31. Tutzauer F (2007) Entropy as a measure of centrality in networks characterized by path-transfer flow. Social Networks 29: 249-265.
32. Wilhelm T, Hollunder J (2007) Information theoretic description of networks. Physica A 388: 385-396.
33. Nikolić S, Trinajstić N (2000) Complexity of molecules. J Chem Inf Comput Sci 40: 920-926.
34. Bertz SH (1981) The first general index of molecular complexity. Journal of the American Chemical Society 103: 3241-3243.
35. Bonchev D (1995) Topological order in molecules 1. molecular branching revisited. Journal of Molecular Structure: THEOCHEM 336: 137-156.
36. Balaban AT (1995) Chemical graphs: Looking back and glimpsing ahead. Journal of Chemical Information and Computer Sciences 35: 339-350.
37. Trinajstić N (1992) Chemical Graph Theory. Boca Raton, FL, USA: CRC Press.
38. Foulds LR (1992) Graph Theory Applications. Springer.
39. Mason O, Verwoerd M (2007) Graph theory and networks in biology. IET Systems Biology 1: 89-119.
40. Emmert-Streib F, Dehmer M (2008) Analysis of Microarray Data: A Network- Based Approach. Weinheim, Germany: Wiley-VCH.
41. Emmert-Streib F, Dehmer M (2009) Information processing in the transcriptional regulatory network of yeast: Functional robustness. BMC Syst Biol 3.
42. Patil A, Esfahanian AH, Xiao L, Liu Y (2007) Resource allocation using multiple edge-sharing multicast trees. IEEE Transactions on Vehicular Technology 58: 3178-3186.
43. Mehler A, Weiβ P, Lücking A (2010) A network model of interpersonal alignment. Entropy 12: 1440-1483.
44. Lyons R (2010) Identities and inequalities for tree entropy. Comb Probab Comput 19: 303-313.
45. Zhang Z, Yeung RW (1998) On characterization of entropy functions via information inequalities. IEEE Transactions on Information Theory 44: 1440-1452.