Entropy, Orbits, and Spectra of Graphs

Analysis of Complex Networks: From Biology to Linguistics

Volumn , Issue , 2009, Pages 1-22

  Mowshowitz, Abbe ^a,b   Mitsou, Valia ^b  

^a City University of New York   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Entropy; Orbits; Spectra of graphs; Structural complexity

Indexed keywords

EID: 76849087642     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9783527627981.ch1     Document Type: Chapter

References (27)

1. Arvind, V. Algebra and Computation. Lecture notes (transcribed by Ramprasad Saptharishi), 2007. http://www.cmi.ac.in/~ramprasad/lecturenotes/algcomp/tillnow.pdf, last viewed 5-30-2008.
2. Bent, G., Dantressangle, P., Vyvyan, D., Mowshowitz, A., and Mitsou, V. A dynamic distributed federated database. Proceedings of the Second Annual Conference of the International Technology Alliance, Imperial College, London, September 2008.
3. Biggs, N.L. Algebraic Graph Theory. Cambridge University Press, Cambridge, 1993.
4. Brandes, U. A faster algorithm for betweenness centrality. J. Math. Sociol. 25 (2001), pp. 163-177.
5. Chao, C.C. A note on the eigenvalues of a graph. J. Combinator. Theory (Series B) 10 (1971), pp. 301-302.
6. Collatz, L., and Sinogowitz, U. Spektrum endlicher Graphen. Abh. Math. Sem. Univ. Hamburg 21 (1957), pp. 63-77.
7. Everett, M. G., and Borgatti, S. Calculating Role Similarities: An Algorithm that helps determine the Orbits of Graph. Social Networks 10 (1988), pp. 77-91.
8. Freeman, L. C. A set of measures of centrality based on betweenness. Sociometry 40 (1977), pp. 35-41.
9. Hage, P. and Harary, F. Eccentricity and centrality in networks. Social Networks 17 (1995), pp. 57-63.
10. Khinchin, A.I. Mathematical Foundations of Information Theory. Dover Publications, New York, 1957.
11. Korner, J. Coding of an information source having ambiguous alphabet and the entropy of graphs. Transactions of Prague Conference on Information Theory, Statistical Decision Functions, Random Processes. (1971), pp. 411-425.
12. Lauri, J. and Scapellato, R. Topics in Graph Automorphisms and Reconstruction. Cambridge University Press, Cambridge, 2003.
13. Mowshowitz, A. Entropy and the complexity of graphs: I. An index of the relative complexity of a graph. Bull. Math. Biophys. 30 (1968), pp. 175-204.
14. Mowshowitz, A. Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs. Bulletin of Mathematical Biophysics 30 (1968), pp. 225-240.
15. Mowshowitz, A. Entropy and the complexity of graphs: III. Graphs with prescribed information content. Bull. Math. Biophys. 30 (1968), pp. 387-414.
16. Mowshowitz, A. Entropy and the complexity of graphs: IV. Entropy measures and graphical structure. Bull. Math. Biophys. 30 (1968), pp. 533-546.
17. Mowshowitz, A. The group of a graph whose adjacency matrix has all distinct eigenvalues. In F. Harary, editor, Proof Techniques in Graph Theory, pp. 109-110. Academic Press, New York, 1969.
18. Mowshowitz, A. Graphs, groups and matrices. In Proceedings of the Canadian Mathematical Congress (1971), pp. 509-522.
19. Mowshowitz, A., Mitsou, V., and Bent, G. Models of network growth by combination. Proceedings of the Second Annual Conference of the International Technology Alliance, Imperial College, London, September 2008.
20. Papireddy, Y.S. A cost efficient approach for finding the orbits to calculate the Entropy of a graph. Project Presentation, Department of Computer Science, The City College of New York, Spring 2007.
21. Rashevsky, N. Life, information theory, and topology. Bull. Math. Biophys. 17 (1955), pp. 229-235.
22. Sabidussi, G. The centrality index of a graph. Psychometrika 31 (1966), pp. 581-603.
23. Shimbel, A. Structural parameters of communication networks. Bull. Math. Biophys. 15 (1953), pp. 501-507.
24. Simonyi, G. Graph entropy: a survey. In W. Cook and L. Lovasz, editors, Combinatorial Optimization. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, 1995.
25. Thompson, D.W. On Growth and Form (abridged version edited by J.T. Bonner). Cambridge University Press, Cambridge, 1961.
26. Trucco, E. A note on the information content of graphs. Bull. Math. Biophys. 18 (1956), pp. 129-135.
27. Wikepedia. Kolmogorov complexity. http://en.wikipedia.org/wiki/Kolmogorov_complexity, last viewed 5-28-2008.