A Review of Graph and Network Complexity from an Algorithmic Information Perspective
Information-theoretic-based measures have been useful in quantifying network complexity. Here we briefly survey and contrast (algorithmic) information-theoretic methods which have been used to characterize graphs and networks. We illustrate the strengths and limitations of Shannon’s entropy, l...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
MDPI AG
2018-07-01
|
| Saila: | Entropy |
| Gaiak: | |
| Sarrera elektronikoa: | http://www.mdpi.com/1099-4300/20/8/551 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
