DUGiDocsMaximizing entropy of cycles on trees
dc.contributor.author
dc.date.accessioned
2018-03-13T07:57:14Z
dc.date.available
2018-03-13T07:57:14Z
dc.date.issued
2013
dc.identifier.issn
1078-0947
dc.identifier.uri
dc.description.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
dc.description.sponsorship
The authors have been partially supported by the MEC grant numbers MTM2008-01486 and MTM2011-26995-C02-01
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
American Institute of Mathematical Sciences (AIMS)
dc.relation
MICINN/PN 2008-2010/MTM2008-01486
dc.relation.isformatof
Versió postprint del document publicat a: https://doi.org/10.3934/dcds.2013.33.3237
dc.relation.ispartof
© Discrete and Continuous Dynamical Systems- Series A, 2013, vol. 33, núm. 8, p. 3237-3276
dc.relation.ispartofseries
Articles publicats (D-IMA)
dc.rights
Tots els drets reservats
dc.title
Maximizing entropy of cycles on trees
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.type.version
info:eu-repo/semantics/acceptedVersion
dc.identifier.doi
dc.identifier.idgrec
017630
dc.contributor.funder
dc.type.peerreviewed
peer-reviewed
dc.identifier.eissn
1553-5231