Information storage, loop motifs, and clustered structure in complex networks.

We use a standard discrete-time linear Gaussian model to analyze the information storage capability of individual nodes in complex networks, given the network structure and link weights. In particular, we investigate the role of two- and three-node motifs in contributing to local information storage. We show analytically that directed feedback and feedforward loop motifs are the dominant contributors to information storage capability, with their weighted motif counts locally positively correlated to storage capability. We also reveal the direct local relationship between clustering coefficient(s) and information storage. These results explain the dynamical importance of clustered structure and offer an explanation for the prevalence of these motifs in biological and artificial networks.

[1]  J. Rogers.  Chaos , 1876, Molecular Vibrations.

[2]  Jeffrey L. Elman,et al.  Finding Structure in Time , 1990, Cogn. Sci..

[3]  S. Soliman,et al.  Continuous and discrete signals and systems , 1990 .

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  G. Edelman,et al.  A measure for brain complexity: relating functional segregation and integration in the nervous system. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[7]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[8]  J. Crutchfield,et al.  Regularities unseen, randomness observed: levels of entropy convergence. , 2001, Chaos.

[9]  Harald Haas,et al.  Harnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication , 2004, Science.

[10]  O. Sporns,et al.  Motifs in Brain Networks , 2004, PLoS biology.

[11]  Sen Song,et al.  Highly Nonrandom Features of Synaptic Connectivity in Local Cortical Circuits , 2005, PLoS biology.

[12]  J. Urry.  Complexity , 2006, Interpreting Art.

[13]  Santhoji Katare,et al.  Optimal complex networks spontaneously emerge when information transfer is maximized at least expense: A design perspective , 2006, Complex..

[14]  Paul P Wang.  Information Sciences 2007 , 2007 .

[15]  G. Fagiolo.  Clustering in complex directed networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Albert Y. Zomaya,et al.  Local information transfer as a spatiotemporal filter for complex systems. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[18]  Minoru Asada,et al.  Initialization and self‐organized optimization of recurrent neural network connectivity , 2009, HFSP journal.

[19]  L Barnett,et al.  Neural complexity and structural connectivity. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Edward T. Bullmore,et al.  Broadband Criticality of Human Brain Network Synchronization , 2009, PLoS Comput. Biol..

[21]  Albert Y. Zomaya,et al.  Information modification and particle collisions in distributed computation. , 2010, Chaos.

[22]  N. Ay,et al.  A geometric approach to complexity. , 2011, Chaos.

[23]  C. Buckley,et al.  Neural complexity: a graph theoretic interpretation. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Mikhail Prokopenko,et al.  Information Dynamics in Small-World Boolean Networks , 2011, Artificial Life.

[25]  Albert Y. Zomaya,et al.  Local measures of information storage in complex distributed computation , 2012, Inf. Sci..