Speaker: Dalia E Terhesiu
Day:  Wednesday, 10/26/2005
Room: ITEB 201
Time: 3:30pm
Title: From dynamical complexity to structural complexity

Abstract:
Should dynamical properties of a system be directly mirrored in its structural properties? Is there a way to qualify a systems' geometrical structure as complex, once we know that the dynamics used to generate it is complex?  To have a way to approach these questions, the following study case was considered. First, we consider a probabilistic dynamics (a set of interval maps associated with probability distributions) that exhibits complex behavior; i.e. under different sets of parameters the dynamics exhibits behavior in all three types of dynamical regimes: periodic, chaotic with the so called "edge of chaos" in between. Then, we generate networks (graphs) out of the dynamics' parameters responsible for producing the three different regimes. Once the graphs are generated, we would like to know if it is possible to structurally distinguish between them. In this sense, we present several measures of structural complexity in networks and discuss their relevance to our problem. Then we test to see if these measures can be used as classifiers of the generated structures.

Selected bibliography: C. Tsallis, ``Nonextensive Statistics: Theoretical, Experimental and Computational Evidences and Connections��,  Brazilian Journal of Physics, vol. 29, no. 1, March, 1999

Note: Main part of the work presented here is the result of the collaboration with A.D. Anastasiadis, L. D. Costa, C. P. Gonzales, C. Honey,   M. I. Szeliga at CSSS05, Santa Fe