Entropy of Digraphs and Infinite Networks
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.
KeywordsDigraphs Entropy Infinite graphs Information content Networks
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.
- 2.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 2008Google Scholar
- 4.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)Google Scholar
- 6.Bonchev, D.: Information Theoretic Indices for Characterization of Chemical Structures. Research Studies Press, Chichester, UK (1983)Google Scholar
- 9.Dehmer, M., Emmert-Streib, F.: Structural information content of chemical networks. Zeitschrift für Naturforschung A 63a, 155–159 (2008)Google Scholar
- 12.Harary, F.: Graph Theory. Addison Wesley, Reading, MA (1969)Google Scholar
- 15.Konstantinova, E.V., Skorobogatov, V.A., Vidyuk, M.V.: Applications of information theory in chemical graph theory. Indian J. Chem. 42, 1227–1240 (2002)Google Scholar
- 16.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)Google Scholar
- 19.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 2008Google Scholar
- 20.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)Google Scholar
- 24.Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, Structural Analysis in the Social Sciences. Cambridge University Press, Cambridge (1994)Google Scholar