Maximizing entropy of cycles on trees

Lluis Alseda, David Juher, Deborah M. King, Francesc Manosas

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

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.
Original languageEnglish
Pages (from-to)3237-3276
JournalDiscrete and Continuous Dynamical Systems
Volume33
DOIs
Publication statusPublished - 1 Aug 2013

Keywords

  • Patterns
  • Topological entropy
  • Tree maps

Fingerprint Dive into the research topics of 'Maximizing entropy of cycles on trees'. Together they form a unique fingerprint.

  • Cite this

    Alseda, L., Juher, D., King, D. M., & Manosas, F. (2013). Maximizing entropy of cycles on trees. Discrete and Continuous Dynamical Systems, 33, 3237-3276. https://doi.org/10.3934/dcds.2013.33.3237