Maximizing entropy of cycles on trees

Abstract

In this paper we give a partial characterization of the periodic tree patterns of maximum entropy for a given period. More precisely, we prove that each periodic pattern with maximal entropy is irreducible (has no block structures) and simplicial (any vertex belongs to the periodic orbit). Moreover, we also prove that it is maximodal in the sense that every point of the periodic orbit is a turning point