Approximate maximizers of intricacy functionals

Details Approximate maximizers of intricacy functionals Approximate maximizers of intricacy functionals

2009-09-11

arxiv.org/abs/0909.2120v2

Mathematics

Probability

Scientific paper

G. Edelman, O. Sporns, and G. Tononi introduced in theoretical biology the neural complexity of a family of random variables. This functional is a special case of intricacy, i.e., an average of the mutual information of subsystems whose weights have good mathematical properties. Moreover, its maximum value grows at a definite speed with the size of the system. In this work, we compute exactly this speed of growth by building "approximate maximizers" subject to an entropy condition. These approximate maximizers work simultaneously for all intricacies. We also establish some properties of arbitrary approximate maximizers, in particular the existence of a threshold in the size of subsystems of approximate maximizers: most smaller subsystems are almost equidistributed, most larger subsystems determine the full system. The main ideas are a random construction of almost maximizers with a high statistical symmetry and the consideration of entropy profiles, i.e., the average entropies of sub-systems of a given size. The latter gives rise to interesting questions of probability and information theory.

Affiliated with

Also associated with

No associations

Rating

Approximate maximizers of intricacy functionals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate maximizers of intricacy functionals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate maximizers of intricacy functionals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427995