PARTITION COMPLEXITY IN A NETWORK OF CHAOTIC ELEMENTS

A network of chaotic elements is investigated with the use of globally coupled maps. Elements can split into clusters with synchronized oscillation. In a partially ordered phase, the clustering has an inhomogeneous tree structure like replica symmetry breaking in spin glass. The clustering has large variety by attractors and strongly depends on initial conditions. Variety of clusterings is characterized by the distribution of partitions originated in spin glass theory. Qualitative similarity and quantitative disagreement of our attractors with spin glass are clarified.