An axiomatic approach to network complexity

Journal of Mathematical Sociology

Volumn 24, Issue 4, 2000, Pages 273-301

  Butts, Carter T ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Axiomatization; Entropy; Graph complexity; Information content

Indexed keywords

EID: 0034346234     PISSN: 0022250X     EISSN: None     Source Type: Journal    
DOI: 10.1080/0022250X.2000.9990239     Document Type: Article

References (24)

1. Bennett, C. H. (1985). Dissipation, Information, Computational Complexity and the Definition of Organization. In D. Pines (Ed.), Emerging Syntheses in Science, 215-233. Redwood City, CA: Addison-Wesley.
2. Butts, C. T. (2000). The Complexity of Social Networks: Theoretical and Empirical Findings. Social Networks, forthcoming.
3. Cover, T. M. and Thomas, J. A. (1991). Elements of Information Theory. New York: John Wiley and Sons.
4. Everett, M. C. (1984). A New Definition for the Dimension of a Graph. Unpublished conference presentation, Sunbelt Network Conference.
5. Everett, M. C. (1985). Role Similarity and Complexity in Social Networks. Social Networks, 7: 353-359.
6. Feldman, D. P. and Crutchfield, J. P. (1998). Discovering Noncritical Organization. Santa Fe Institute Working Paper, 98-04-026.
7. Freeman, L. C. (1980). Q-Analysis and the Structure of Friendship Networks. International Journal of Man-Machine Studies, 12: 367-378.
8. Freeman, L. C. (1983). Spheres, Cubes, and Boxes: Graph Dimensionality and Network Structure. Social Networks, 5: 139-156.
9. Guttman, L. (1977). A Definition of Dimensionality and Distance for Graphs. In J. C. Lingoes (Ed.), Geometric Representations of Relational Data. Ann Arbor: M. I. Mathesis.
10. Kaspar, F. and Schuster, H. G. (1987). Easily Calculable Measure for the Complexity of Spatiotemporal Patterns. Physical Review A, 36(2): 842-848.
11. Kolmogorov, A. N. (1965). Three Approaches to the Definition of the Concept "Quantity of Information". Problems in Information Transmission, 1: 3-11.
12. Lempel, A. and Ziv, J. (1976). On the Complexity of Finite Sequences. IEEE Transactions on Information Theory, 22: 75.
13. Li, M. and Vityáni, P. M. B. (1991). Combinatorics and Kolmogorov Complexity. In Proceedings of the Sixth Annual IEEE Conference on Structure in Complexity Theory.
14. Lloyd, S. and Pagels, H. (1988). Complexity as Thermodynamic Depth. Annals of Physics, 188: 186-213.
15. Morowitz, H. J. (1955). Some Order-Disorder Considerations in Living Systems. Bulletin of Mathematical Biophysics, 17: 81-86.
16. Mowshowitz, A. (1968a). Entropy and the Complexity of Graphs I: An Index of the Relative Complexity of a Graph. Bulletin of Mathematical Biophysics, 30: 175-204.
17. Mowshowitz, A. (1968b). Entropy and the Complexity of Graphs II: The Information Content of Graphs and Digraphs. Bulletin of Mathematical Biophysics, 30: 175-204.
18. Mowshowitz, A. (1968c). Entropy and the Complexity of Graphs III: Graphs With Prescribed Information Content. Bulletin of Mathematical Biophysics, 30: 175-204.
19. Rashevsky, N. (1955). Life, Information Theory, and Topology. Bulletin of Mathematical Biophysics, 17: 229-235.
20. Rényi, A. (1961). On Measures of Entropy and Information. In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability. Berkeley: University of California Press.
21. Roberts, F. (1969). On the Boxicity and Cubicity of a Graph. In W. T. Tutte (Ed.), Recent Progress in Combinatorics. New York: Academic Press.
22. Shannon, C. (1948). A Mathematical Theory of Communication. Bell System Technical Journal, 27: 379-423.
23. Trucco, E. (1956). On the Information Content of Graphs: Compound Symbols; Different States for Each Point. Bulletin of Mathematical Biophysics, 18: 237-253.
24. Wolpert, D. H. and Macready, W. G. (1998). Self-Dissimilarity: An Empirical Measure of Complexity. Santa Fe Institute Working Paper.