Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An axiomatic approach to network complexity

From MaRDI portal
Publication:2731526
Jump to:navigation, search

DOI10.1080/0022250X.2000.9990239zbMath0989.91095MaRDI QIDQ2731526

Carter T. Butts

Publication date: 6 May 2002

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


zbMATH Keywords

entropyaxiomatizationinformation contentgraph complexity


Mathematics Subject Classification ID

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


Related Items (2)

Entropy and the complexity of graphs revisited ⋮ A STRUCTURAL APPROACH TO THE REPRESENTATION OF LIFE HISTORY DATA1




Cites Work

  • On the Complexity of Finite Sequences
  • Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2731526&oldid=15591459"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 13:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki