An axiomatic approach to network complexity
Bibliographic Data
| ID | 10142101 |
|---|---|
| Authors | C T Butts (0000-0002-7911-9834, Decision Sciences (United States), corresponding author) |
| Year | 2000 |
| Volume | 24 |
| Issue | 4 |
| Pages | 273-301 |
| Publication date | 2000-12-01 |
| Open Access | No |
| Type | ARTICLE |
| Venue | Journal of Mathematical Sociology (JOURNAL) |
| Journal identifiers | ISSN: 0022-250X • E-ISSN: 1545-5874 |
| Publisher | Taylor & Francis (PUBLISHER • GB) |
| DOI | 10.1080/0022250x.2000.9990239 |
| OpenAlex | W2048944874 |
| Language | EN |
| Citations received | 6 |
| References cited | 13 |
Despite the recent wave of interest in the social and physical sciences regarding “complexity,” relatively title attention has been given to the logical foundation of complexity measurement. With this in mind, a number of fairly simple, “reasonable” axioms for the measurement of network complexity are here presented, and some of the implications of these axioms are considered. It is shown that the only family of graph complexity measures satisfying the “reasonable” axioms is of limited theoretical utility, and hence that those seeking more interesting measures of complexity must be willing to sacrifice at least one intuitively reasonable constraint. Several existing complexity measures are also described, and are differentiated from one another on an axiomatic basis. Finally, some suggestions are offered regarding future efforts at measuring graph complexity
Algorithm · Axiom · Axiomatic system · Computational complexity theory · Constraint (computer-aided design · Epistemology · Graph · Simple (philosophy · Complex Network Analysis Techniques · Computer Science · Economic and Technological Innovation · Mathematics · Origins and Evolution of Life · Theoretical Computer Science
| Citations per year | 0.24 |
|---|---|
| Citation span | 2001 - 2019 (19) |
| Highly cited | No |