Maximizing entropy of cycles on trees
In this paper we give a partial characterization of the periodic tree patterns of maximum entropy. More precisely, we prove that each periodic pattern with maximal entropy is irreducible and simplicial. Moreover, it is also maximodal in the sense that for every monotone representative of the pattern...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:150638 |
| Acceso en línea: | https://ddd.uab.cat/record/150638 https://dx.doi.org/urn:doi:10.3934/dcds.2013.33.3237 |
| Access Level: | acceso abierto |
| Palabra clave: | Tree maps Patterns Topological entropy |
| Sumario: | In this paper we give a partial characterization of the periodic tree patterns of maximum entropy. More precisely, we prove that each periodic pattern with maximal entropy is irreducible and simplicial. Moreover, it is also maximodal in the sense that for every monotone representative of the pattern every periodic point is a "turning point". |
|---|