On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy
Author
Abstract
Suggested Citation
DOI: 10.1155/2017/3250301
Download full text from publisher
References listed on IDEAS
- Cao, Shujuan & Dehmer, Matthias & Kang, Zhe, 2017. "Network Entropies Based on Independent Sets and Matchings," Applied Mathematics and Computation, Elsevier, vol. 307(C), pages 265-270.
- Fernando Soler-Toscano & Hector Zenil & Jean-Paul Delahaye & Nicolas Gauvrit, 2014. "Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines," PLOS ONE, Public Library of Science, vol. 9(5), pages 1-18, May.
- Kim, Jongkwang & Wilhelm, Thomas, 2008. "What is a complex graph?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(11), pages 2637-2652.
- Jean-Paul Delahaye & Hector Zenil, 2012. "Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness," Post-Print hal-00825530, HAL.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- León, Carlos, 2021. "The adoption of a mobile payment system: the user perspective," Latin American Journal of Central Banking (previously Monetaria), Elsevier, vol. 2(4).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Dingle, Kamaludin & Kamal, Rafiq & Hamzi, Boumediene, 2023. "A note on a priori forecasting and simplicity bias in time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
- Zenil, Hector & Soler-Toscano, Fernando & Dingle, Kamaludin & Louis, Ard A., 2014. "Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 341-358.
- Fernando Soler-Toscano & Hector Zenil, 2017. "A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences," Complexity, Hindawi, vol. 2017, pages 1-10, December.
- Maxwell Murialdo & Arturo Cifuentes, 2022. "Quantifying Value with Effective Complexity," Journal of Interdisciplinary Economics, , vol. 34(1), pages 69-85, January.
- Tuğal, İhsan & Karcı, Ali, 2019. "Comparisons of Karcı and Shannon entropies and their effects on centrality of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 352-363.
- Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
- Lavanya Sivakumar & Matthias Dehmer, 2012. "Towards Information Inequalities for Generalized Graph Entropies," PLOS ONE, Public Library of Science, vol. 7(6), pages 1-14, June.
- Ghorbani, Modjtaba & Dehmer, Matthias & Rajabi-Parsa, Mina & Emmert-Streib, Frank & Mowshowitz, Abbe, 2019. "Hosoya entropy of fullerene graphs," Applied Mathematics and Computation, Elsevier, vol. 352(C), pages 88-98.
- Ma, Yuede & Cao, Shujuan & Shi, Yongtang & Dehmer, Matthias & Xia, Chengyi, 2019. "Nordhaus–Gaddum type results for graph irregularities," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 268-272.
- Brandouy, Olivier & Delahaye, Jean-Paul & Ma, Lin & Zenil, Hector, 2014.
"Algorithmic complexity of financial motions,"
Research in International Business and Finance, Elsevier, vol. 30(C), pages 336-347.
- O. Brandouy & Lin Ma & Hector Zenil & Jean-Paul Delahaye, 2012. "Algorithmic complexity of financial motions," Post-Print hal-00802537, HAL.
- Olivier Brandouy & Jean-Paul Delahaye & Lin Ma & Hector Zenil, 2012. "Algorithmic Complexity of Financial Motions," ASSRU Discussion Papers 1204, ASSRU - Algorithmic Social Science Research Unit.
- Daniel Wilson-Nunn & Hector Zenil, 2014. "On the Complexity and Behaviour of Cryptocurrencies Compared to Other Markets," Papers 1411.1924, arXiv.org.
- Wang, Jiang & Yang, Chen & Wang, Ruofan & Yu, Haitao & Cao, Yibin & Liu, Jing, 2016. "Functional brain networks in Alzheimer’s disease: EEG analysis based on limited penetrable visibility graph and phase space method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 460(C), pages 174-187.
- Raducha, Tomasz & Gubiec, Tomasz, 2017. "Coevolving complex networks in the model of social interactions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 427-435.
- Frank Emmert-Streib, 2013. "Structural Properties and Complexity of a New Network Class: Collatz Step Graphs," PLOS ONE, Public Library of Science, vol. 8(2), pages 1-14, February.
- Wan, Pengfei & Tu, Jianhua & Dehmer, Matthias & Zhang, Shenggui & Emmert-Streib, Frank, 2019. "Graph entropy based on the number of spanning forests of c-cyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
- Lin, Yun Hui & Wang, Yuan & Lee, Loo Hay & Chew, Ek Peng, 2021. "Consistency matters: Revisiting the structural complexity for supply chain networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
- Lei, Hui & Li, Tao & Ma, Yuede & Wang, Hua, 2018. "Analyzing lattice networks through substructures," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 297-314.
- Mehmet N. Aydin & N. Ziya Perdahci, 0. "Dynamic network analysis of online interactive platform," Information Systems Frontiers, Springer, vol. 0, pages 1-12.
- Ferman Hasan, 2021. "Contribution of eye-tracking to the study on perception of the complexity," Technium Social Sciences Journal, Technium Science, vol. 20(1), pages 612-626, June.
- Yu, Guihai & Qu, Hui, 2018. "The coefficients of the immanantal polynomial," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 38-44.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:3250301. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.