Berlin 2012 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

DY: Fachverband Dynamik und Statistische Physik

DY 30: Networks IV (with SOE)

DY 30.3: Talk

Friday, March 30, 2012, 10:30–10:45, MA 001

Information storage, loop motifs and clustered structure in complex networks — •Joseph T. Lizier, Fatihcan M. Atay, and Jürgen Jost — Max Planck Institute for Mathematics in the Sciences, Inselstrasse 22, 04103 Leipzig, Germany

Information storage is a key operation in distributed computation, and an important analytic tool for understanding dynamics on, and information processing capabilities of, complex networks. We use a standard discrete-time linear Gaussian model to analyze information storage capability of individual nodes in complex networks, given network structure and link weights. In particular, we investigate the role of two and three-node motifs in contributing to information storage, and express information storage analytically in terms of the contributions of these motifs. We show analytically that directed feedback loops and feedforward loop motifs are the dominant contributors to information storage capability. Crucially, where the network contains positive edge weights on average, the information storage capability is positively correlated to the counts of these motifs. We also show the direct relationship between clustering coefficient(s) and information storage which results from these expressions. These results explain the dynamical importance of clustered structure, and offer an explanation for the prevalence of these motifs in biological and artificial networks.