An axiomatic approach to network complexity

DOI10.1080/0022250X.2000.9990239MaRDI QIDQ2731526zbMATH OpenFDO

Authors Carter T. Butts

Publication date 6 May 2002

Published in The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0022250X.2000.9990239

zbMATH Keywords

axiomatizationentropygraph complexityinformation content

Mathematics Subject Classification ID

Measurement theory in the social and behavioral sciences (91C05) Social networks; opinion dynamics (91D30)

Recommendations

• Entropy and the complexity of graphs revisited
• Complexity of networks
• Functional complexity based on topology
• Measurement methods on the complexity of network
• scientific article; zbMATH DE number 3924114

Cites work

• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• scientific article; zbMATH DE number 3173999 (Why is no real title available?)
• On the Complexity of Finite Sequences

Cited in

(13)

• An axiomatic characterization of the position value for network situations
• Spectral complexity of directed graphs and application to structural decomposition
• Towards a mathematics of complexity
• Complexity, networks, and non-uniqueness
• Functional complexity based on topology
• The complexity of computations by networks
• Entropy and the complexity of graphs revisited
• A STRUCTURAL APPROACH TO THE REPRESENTATION OF LIFE HISTORY DATA¹
• scientific article; zbMATH DE number 1890107 (Why is no real title available?)
• scientific article; zbMATH DE number 1890124 (Why is no real title available?)
• On complexity of statements and meaningful complexity of an axiomatic theory
• Depth-based complexity traces of graphs
• How should complexity scale with system size?

This page was built for publication: An axiomatic approach to network complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2731526)