Entropy and the complexity of graphs revisited

Entropy

Volumn 14, Issue 3, 2012, Pages 559-570

  Mowshowitz, Abbe ^a   Dehmer, Matthias ^b  

^a City College of the City University of New York   (United States)

^b UNIVERSITY FOR HEALTH SCIENCES   (Austria)

Author keywords

Complex networks; Graph entropy; Shannon entropy

Indexed keywords

EID: 84861128686     PISSN: None     EISSN: 10994300     Source Type: Journal    
DOI: 10.3390/e14030559     Document Type: Article

References (49)

1. Rashevsky, N. Life, information theory, and topology. Bull. Math. Biophys. 1955, 17, 229-235.
2. Albert, R.; Jeong, H.; Barab́asi, A.L. Diameter of the world wide web. Nature 1999, 401, 130-131.
3. Albert, R.; Barab́asi, A.L. Statistical mechanics of complex networks. Rev. Mod. Phys. 2002, 74, 47.
4. Bonchev, D.; Trinajstíc, N. Information theory, distance matrix and molecular branching. J. Chem. Phys. 1977, 67, 4517-4533.
5. Bonchev, D. Information Theoretic Indices for Characterization of Chemical Structures; Research Studies Press: Chichester, West Sussex, UK, 1983.
6. Butts, C.T. The complexity of social networks: Theoretical and empirical findings. Soc. Network. 2001, 23, 31-71.
7. Mehler, A.; Weiß, P.; L̈ucking, A. A network model of interpersonal alignment. Entropy 2010, 12, 1440-1483.
8. Soĺe, R.V.; Montoya, J.M. Complexity and fragility in ecological networks. Proc. Roy. Soc. Lond. B Biol. Sci. 2001, 268, 2039-2045.
9. Ulanowicz, R.E. Quantitative methods for ecological network analysis. Comput. Biol. Chem. 2004, 28, 321-339.
10. Dehmer, M.; Barbarini, N.; Varmuza, K., Graber A. Novel topological descriptors for analyzing biological networks. BMC Struct. Biol. 2010, 10, doi:10.1186/1472-6807-10-18.
11. Basak, S.C.; Balaban, A.T.; Grunwald, G.D.; Gute, B.D. Topological indices: Their nature and mutual relatedness. J. Chem. Inf. Comput. Sci. 2000, 40, 891-898.
12. Bonchev, D., Rouvray, D.H., Eds. Complexity in Chemistry, Biology, and Ecology; Mathematical and Computational Chemistry; Springer: New York, NY, USA, 2005.
13. Emmert-Streib, F.; Dehmer, M. Information theoretic measures of UHG graphs with low computational complexity. Appl. Math. Comput. 2007, 190, 1783-1794.
14. Dehmer, M.; Mowshowitz, A. A history of graph entropy measures. Inform. Sci. 2011, 1, 57-78.
15. Mowshowitz, A. Entropy and the complexity of the graphs: I. An index of the relative complexity of a graph. Bull. Math. Biophys. 1968, 30, 175-204.
16. Anand, K.; Bianconi, G. Entropy measures for networks: Toward an information theory of complex topologies. Phys. Rev. E 2009, 80, 045102(R).
17. Soĺe, R.V.; Valverde, S. Information theory of complex networks: On evolution and architectural constraints. Lect. Notes Phys. 2004, 650, 189-207.
18. Thurner, S. Statistical mechanics of complex networks. In Analysis of Complex Networks: From Biology to Linguistics; Dehmer, M., Emmert-Streib, F., Eds. Wiley-VCH: Weinheim, Germany, 2009; pp. 23-45.
19. Wilhelm, T.; Hollunder, J. Information theoretic description of networks. Physica A 2007, 388, 385-396.
20. Constantine, G. Graph complexity and the Laplacian matrix in blocked experiments. Linear and Multilinear Algebra 1990, 28, 49-56.
21. Bonchev, D. Kolmogorov's information, Shannon's entropy, and topological complexity of molecules. Bulg. Chem. Commun. 1995, 28, 567-582.
22. Dehmer, M. Information processing in complex networks: Graph entropy and information functionals. Appl. Math. Comput. 2008, 201, 82-94.
23. Dehmer, M.; Mowshowitz, A. Generalized graph entropies. Complexity 2011, 17, 45-50.
24. Kolmogorov, A.N. Three approaches to the definition of information (in Russian). Probl. Peredaci Inform. 1965, 1, 3-11.
25. Li, M.; Vit́anyi, P. An Introduction to Kolmogorov Complexity and Its Applications; Springer: New York, NY, USA, 1997.
26. Bertz, S.H.; Sommmer, T.J. Rigorous mathematical approaches to strategic bonds and synthetic analysis based on conceptually simple new complexity indices. Chem. Commun. 1997, doi:10.1039/A706192G.
27. Bonchev, D. Complexity analysis of yeast proteome network. Chem. Biodivers. 2004, 1, 312-326.
28. Platt, J.R. Influence of neighbor bonds on additive bond properties in paraffins. J. Chem. Phys. 1947, 15, 419-420.
29. Bonchev, D. Overall connectivities and topological complexities: A new powerful tool for QSPR/QSAR. J. Chem. Inf. Comput. Sci. 2000, 40, 934-941.
30. Bonchev, D. The overall Wiener index-A new tool for characterization of molecular topology. J. Chem. Inf. Comput. Sci. 2001, 41, 582-592.
31. Bonchev, D. The overall topological complexity indices. In Advances in Computational Methods in Science and Engineering; Simos, T., Maroulis, G., Eds.; VSP Publications: Melville, NY, USA, 2005; Volume 4B, pp. 1554-1557.
32. Pudĺak, P.; R̈odl, V.; Savickíy, P. Graph complexity. Acta Informatica 1988, 25, 515-535.
33. Shannon, C.E.; Weaver, W. The Mathematical Theory of Communication; University of Illinois Press: Urbana, IL, USA, 1949.
34. Cover, T.M.; Thomas, J.A. Elements of Information Theory; Wiley Series in Telecommunications and Signal Processing; Wiley & Sons: Hoboken, NJ, USA, 2006.
35. Butts, C.T. An axiomatic approach to network complexity. J. Math. Sociol. 2000, 24, 273-301.
36. Mowshowitz, A. Entropy and the complexity of graphs II: The information content of digraphs and infinite graphs. Bull. Math. Biophys. 1968, 30, 225-240.
37. Bonchev, D. Information theoretic measures of complexity. In Encyclopedia of Complexity and System Science; Meyers, R., Ed.; Springer: New York, NY, USA, 2009; Volume 5, pp.4820-4838.
38. Todeschini, R.; Consonni, V.; Mannhold, R. Handbook of Molecular Descriptors; Wiley-VCH: Weinheim, Germany, 2002.
39. Bang-Jensen, J.; Gutin, G. Digraphs, Theory, Algorithms and Applications; Springer: London, UK, 2002.
40. K̈orner, J. Coding of an information source having ambiguous alphabet and the entropy of graphs. In Proceedings of the 6th Prague Conference on Information Theory, Prague, Czech Republic, 1973; pp. 411-425.
41. Simonyi, G. Graph entropy: A survey. In Combinatorial Optimization; Cook, W., Lov́asz, L., Seymour, P., Eds.; DIMACS Series in Discrete Mathematics and Theoretical Computer Science; American Mathematical Society: Providence, RI, USA, 1995; Volume 20, pp. 399-441.
42. Cardinal, L.; Fiorini, S.; Assche, G.V. On minimum entropy graph colorings. In Proceedings of the 2004 IEEE International Symposium on Information Theory, Piscataway, NJ, USA, 2004; p. 43.
43. Dehmer, M.; Varmuza, K.; Borgert, S.; Emmert-Streib, F. On entropy-based molecular descriptors: Statistical analysis of real and synthetic chemical structures. J. Chem. Inf. Model. 2009, 49, 1655-1663.
44. Dehmer, M.; Mowshowitz, A.; Emmert-Streib, F. Connections between classical and parametric network entropies. PLoS One 2011, 6, e15733.
45. Dehmer, M.; Sivakumar, L.; Varmuza, K. Uniquely discriminating molecular structures using novel eigenvalue-based descriptors. MATCH Commun. Math. Comput. Chem. 2012, 67, 147-172.
46. Polansky, O.E.; Bonchev, D. The Wiener number of graphs. I. General theory and changes due to graph operations. MATCH MATCH Commun. Math. Comput. Chem. 1986, 21, 133-186.
47. Hosoya, H. On some counting polynomials. Discrete Appl. Math. 1988, 19, 239-257.
48. Balaban, A.T.; Harary, F. The characteristic polynomial does not uniquely determined the topology of a molecule. J. Chem. Doc. 1971, 11, 258-259.
49. Randíc, M.; Vracko, M.; Novic, M. Eigenvalues as molecular descriptors. In QSPR/QSAR Studies by Molecular Descriptors; Diudea, M.V., Ed.; Nova Publishing: Huntington, NJ, USA, 2001; pp. 93-120.