Lossy Asymptotic Equipartition Property for Networked Data Structures
Kwabena Doku-Amponsah1 Show affiliations
- University of Ghana, Ghana
Journal of Mathematics and Statistics, Volume 13, Issue 2, pp. 152–158 · doi.org/10.3844/jmssp.2017.152.158
Abstract
In this study, we prove a Generalized Information Theory for Networked Data Structures modelled as random graphs. The main tools in this study remain large deviation principles for properly defined empirical measures on random graphs. To motivate the paper, we apply our main result to a concrete example from the field of Biology.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Doku-Amponsah, K. (2017). Lossy Asymptotic Equipartition Property for Networked Data Structures. Journal of Mathematics and Statistics, 13(2), 152–158. https://doi.org/10.3844/jmssp.2017.152.158
- Licence
- CC BY 3.0
- Issue
- Volume 13, Issue 2
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
