# An equation-free approach to coarse-graining the dynamics of networks

## Author(s): Bold, K.A.; Rajendran, K.; Ráth, B.; Kevrekidis, Yannis G.

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr17z82
 Abstract: © American Institute of Mathematical Sciences. We propose and illustrate an approach to coarse-graining the dynamics of evolving networks, i.e., networks whose connectivity changes dynamically. The approach is based on the equation-free framework: short bursts of detailed network evolution simulations are coupled with lifting and restriction operators that translate between actual network realizations and their appropriately chosen coarse observables. This framework is used here to accelerate temporal simulations through coarse projective integration, and to implement coarse-grained fixed point algorithms through matrix-free Newton-Krylov. The approach is illustrated through a very simple network evolution example, for which analytical approximations to the coarse-grained dynamics can be independently obtained, so as to validate the computational results. The scope and applicability of the approach, as well as the issue of selection of good coarse observables are discussed. Publication Date: 1-Jun-2014 Citation: Bold, KA, Rajendran, K, Ráth, B, Kevrekidis, IG. (2014). An equation-free approach to coarse-graining the dynamics of networks. Journal of Computational Dynamics, 1 (1), 111 - 134. doi:10.3934/jcd.2014.1.111 DOI: doi:10.3934/jcd.2014.1.111 EISSN: 2158-2505 Pages: 111 - 134 Type of Material: Journal Article Journal/Proceeding Title: Journal of Computational Dynamics Version: Author's manuscript