title: Information storage, loop motifs, and clustered structure in complex networks.
abstract: 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.
authors.affiliation: Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany. lizier@mis.mpg.de
authors.forename: Joseph T
authors.initials: JT
authors.lastname: Lizier
authors.forename: Fatihcan M
authors.initials: FM
authors.lastname: Atay
authors.forename: Jürgen
authors.initials: J
authors.lastname: Jost
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D003198:Computer Simulation; D019277:Entropy; D006801:Humans; D016247:Information Storage and Retrieval / Q000379:methods*; D016014:Linear Models; D008954:Models, Biological; D015233:Models, Statistical; D015999:Multivariate Analysis; D016011:Normal Distribution; D012984:Software