Lossy asymptotic equipartition property for hierarchical data structures

DOI10.17654/MS101051013zbMATH Open1390.94713arXiv1608.04154MaRDI QIDQ5269612FDOQ5269612

Authors: Kwabena Doku-Amponsah 

Publication date: 27 June 2017

Published in: Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Abstract: This paper presents a rate-distortion theory for hierarchical networked data structures modelled as tree-indexed multitype process. To be specific, this paper gives a generalized Asymptotic Equipartition Property (AEP) for the Process. The general methodology of proof of the AEP are process level large deviation principles for suitably defined empirical measures for muiltitype Galton-Watson trees.

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

Recommendations

• Asymptotic equipartition properties for simple hierarchical and networked structures
• scientific article; zbMATH DE number 1522491
• The Generalized Asymptotic Equipartition Property: Necessary and Sufficient Conditions
• Source coding, large deviations, and approximate pattern matching
• scientific article; zbMATH DE number 763790

zbMATH Keywords

relative entropyasymptotic equipartition propertyempirical measurerate-distortion theoryPerron-Frobenius eigenvalueweak irreducibilityPerron-Frobenius eigenvector

Mathematics Subject Classification ID

Large deviations (60F10) Random graphs (graph-theoretic aspects) (05C80) Information theory (general) (94A15) Rate-distortion theory in information and communication theory (94A34)

Cited In (3)

• A catalog of self-affine hierarchical entropy functions
• On Hierarchical Type Covering
• Asymptotic equipartition properties for simple hierarchical and networked structures

This page was built for publication: Lossy asymptotic equipartition property for hierarchical data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269612)