Maximizing entropy of cycles on trees
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,...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2013 |
| País: | España |
| Recursos: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/15134 |
| Acesso em linha: | http://hdl.handle.net/10256/15134 |
| Access Level: | acceso abierto |
| Palavra-chave: | Entropia topològica Topological entropy Arbres (Teoria de grafs) Trees (Graph theory) |
| Resumo: | 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 |
|---|