Abstract
The information content of a graph G is defined in Mowshowitz (Bull Math Biophys 30:175–204, 1968) as the entropy of a finite probability scheme associated with the vertex partition determined by the automorphism group of G. This provides a quantitative measure of the symmetry structure of a graph that has been applied to problems in such diverse fields as chemistry, biology, sociology, and computer science (Mowshowitz and Mitsou, Entropy, orbits and spectra of graphs, Wiley-VCH, 2009). The measure extends naturally to directed graphs (digraphs) and can be defined for infinite graphs as well (Mowshowitz, Bull Math Biophys 30:225–240, 1968).This chapter focuses on the information content of digraphs and infinite graphs. In particular, the information content of digraph products and recursively defined infinite graphs is examined.
MSC2000 Primary 68R10; Secondary 05C20, 05C25, 05C75, 94C15, 90B10.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Balaban, A.T., Balaban, T.S.: New vertex invariants and topological indices of chemical graphs based on information on distances. J. Math. Chem. 8, 383–397 (1991)
Bent, G., Dantressangle, P., Vyvyan, D., Mowshowitz, A., Mitsou, V.: A dynamic distributed federated database. Proceedings of the Second Annual Conference of the International Technology Alliance, Imperial College, London, September 2008
Bertz, S.H.: The first general index of molecular complexity. J. Am. Chem. Soc. 103, 3241–3243 (1981)
Bloom, G., Kennedy, J.W., Quintas, L.V.: Distance degree regular graphs. In: Chartrand, G. (ed.) The Theory of Applications of Graphs, pp. 95–108. Wiley, New York (1981)
Bollobás, B., Riordan, O.: The diameter of a scalefree random graph. Combinatorika 24, 5–34 (2004)
Bonchev, D.: Information Theoretic Indices for Characterization of Chemical Structures. Research Studies Press, Chichester, UK (1983)
Bonchev, D.: Complexity in Chemistry, Biology, and Ecology. Mathematical and Computational Chemistry series. Springer, New York (2005)
Bonchev, D., Trinajstic, N.: Information theory, distance matrix and molecular branching. J. Chem. Phys. 67, 4517–4533 (1977)
Dehmer, M., Emmert-Streib, F.: Structural information content of chemical networks. Zeitschrift für Naturforschung A 63a, 155–159 (2008)
Dehmer, M., Emmert-Streib, F., Mehler, A. (eds.): Towards an Information Theory of Complex Networks: Statistical Methods and Applications. Springer/Birkhäuser, Berlin (2011)
Dehmer, M., Mowshowitz, A.: Inequalities for entropy-based measures of network information content. Appl. Math. Comput. 215, 4263–4271 (2010)
Harary, F.: Graph Theory. Addison Wesley, Reading, MA (1969)
Hirata, H., Ulanowicz, R.E.: Information theoretical analysis of ecological networks. Int. J. Syst. Sci. 15, 261–270 (1984)
Khinchin, A.I.: Mathematical Foundations of Information Theory. Dover Publications, New York (1957)
Konstantinova, E.V., Skorobogatov, V.A., Vidyuk, M.V.: Applications of information theory in chemical graph theory. Indian J. Chem. 42, 1227–1240 (2002)
Körner, J.: Coding of an information source having ambiguous alphabet and the entropy of graphs. In: Transactions of the 6th Prague Conference on Information Theory, 411–425 (1973)
Mowshowitz, A.: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph. Bull. Math. Biophys. 30, 175–204 (1968)
Mowshowitz, A.: Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs. Bull. Math. Biophys. 30, 225–240 (1968)
Mowshowitz, A., Mitsou, V., Bent, G.: Models of network growth by combination. Proceedings of the Second Annual Conference of the International Technology Alliance, Imperial College, London, September 2008
Mowshowitz, A., Mitsou, V.: Entropy, orbits and spectra of graphs. In: Dehmer, M. (ed.) Analysis of Complex Networks: From Biology to Linguistics. Wiley-VCH, Weinheim (2009, in press)
Rashevsky, N.: Life, information theory, and topology. Bull. Math. Biophys. 17, 229–235 (1955)
Skorobogatov, V.A., Dobrynin, A.A.: Metric analysis of graphs. MATCH 23, 105–151 (1988)
Sole, R.V., Valverde, S.: Information theory of complex networks: On evolution and architectural constraints. Lect. Notes Phys. 650, 189–207 (2004)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, Structural Analysis in the Social Sciences. Cambridge University Press, Cambridge (1994)
Acknowledgments
Research was sponsored by the US Army Research Laboratory and the UK Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the US Army Research Laboratory, the US Government, the UK Ministry of Defence, or the UK Government. The US and UK Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Mowshowitz, A. (2011). Entropy of Digraphs and Infinite Networks. In: Dehmer, M., Emmert-Streib, F., Mehler, A. (eds) Towards an Information Theory of Complex Networks. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-4904-3_1
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4904-3_1
Published:
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-4903-6
Online ISBN: 978-0-8176-4904-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)