Comparing entropy rates on finite and infinite rooted trees

2016/11/22 by Hirschler, Thomas, Woess, Wolfgang
#05C05 #60G99 #94A17 #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Probability (math.PR)

paper · doi:10.48550/arxiv.1611.07214

Abstract

We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a perturbation of the former. The processes are described by probability measures on the boundary of the given tree, and by corresponding forward transition probabilities at the inner nodes. The comparison is in terms of Kullback-Leibler divergence. We elaborate and extend ideas and results of Böcherer and Amjad. Our extensions involve length functions on the edges of the tree as well as nodes with countably many successors. In particular, in the last part, we consider trees with infinite geodesic rays and random perturbations of a given process.

Related

• Rooted Trees with Probabilities Revisited
• Typicality and entropy of processes on infinite trees
• Informational Divergence and Entropy Rate on Rooted Trees with Probabilities
• Entropy inequalities and exponential decay of correlations for unique Gibbs measures on trees
• A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs