Locking-time and Information Capacity in CML with Statistical Periodicity
Chaotic Dynamics
2010-11-25 v1
Abstract
In this work we address the statistical periodicity phenomenon on a coupled map lattice. The study was done based on the asymptotic binary patterns. The pattern multiplicity gives us the lattice information capacity, while the entropy rate allows us to calculate the locking-time. Our results suggest that the lattice has low locking-time and high capacity information when the coupling is weak. This is the condition for the system to reproduce a kind of behavior observed in neural networks.
Keywords
Cite
@article{arxiv.1011.5354,
title = {Locking-time and Information Capacity in CML with Statistical Periodicity},
author = {Romeu Miqueias Szmoski and Rodrigo Frehse Pereira and Fabiano Alan Serafim Ferrari and Sandro Ely de Souza Pinto},
journal= {arXiv preprint arXiv:1011.5354},
year = {2010}
}
Comments
8 pages, 6 figures - submitted to Journal of Physics: Conference Series for the proceedings of the Dynamics Days South America 2010