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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Information‐Based Complexity of Networks

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

DOI10.1002/9783527670468.CH09zbMath1328.94111arXiv1402.2696OpenAlexW1596897996MaRDI QIDQ3463390

Russell K. Standish

Publication date: 14 January 2016

Published in: Advances in Network Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.2696


zbMATH Keywords

Gaussian processesBoolean networksdynamical processesnetwork complexityinformation-based measures


Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Information theory (general) (94A15) Applications of graph theory to circuits and networks (94C15)








This page was built for publication: Information‐Based Complexity of Networks

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