טוען...
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, lossles...
שמור ב:
| הוצא לאור ב: | Entropy (Basel) |
|---|---|
| Main Authors: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
MDPI
2018
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7513075/ https://ncbi.nlm.nih.gov/pubmed/33265640 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e20080551 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|