Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T07:27:26.252Z Has data issue: false hasContentIssue false

Mutual information decay for factors of i.i.d.

Published online by Cambridge University Press:  29 April 2018

BALÁZS GERENCSÉR
Affiliation:
MTA Alfréd Rényi Institute of Mathematics, H-1053 Budapest, Reáltanoda utca 13-15, Hungary email gerencser.balazs@renyi.mta.hu, harangi@renyi.huELTE Eötvös Loránd University, Department of Probability and Statistics, H-1117 Budapest, Pázmány Péter sétány 1/c, Hungary
VIKTOR HARANGI
Affiliation:
MTA Alfréd Rényi Institute of Mathematics, H-1053 Budapest, Reáltanoda utca 13-15, Hungary email gerencser.balazs@renyi.mta.hu, harangi@renyi.hu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper is concerned with factors of independent and identically distributed processes on the $d$-regular tree for $d\geq 3$. We study the mutual information of values on two given vertices. If the vertices are neighbors (i.e. their distance is $1$), then a known inequality between the entropy of a vertex and the entropy of an edge provides an upper bound for the (normalized) mutual information. In this paper we obtain upper bounds for vertices at an arbitrary distance $k$, of order $(d-1)^{-k/2}$. Although these bounds are sharp, we also show that an interesting phenomenon occurs here: for any fixed process, the rate of mutual information decay is much faster, essentially of order $(d-1)^{-k}$.

Information

Type
Original Article
Copyright
© Cambridge University Press, 2018