THE INFORMATION BOTTLENECK METHOD FOR OPTIMAL PREDICTION OF MULTILEVEL AGENT-BASED SYSTEMS

Authored by Sven Banisch, Robin Lamarche-Perrin, Eckehard Olbrich

Date Published: 2016

DOI: 10.1142/s0219525916500028

Sponsors: European Union

Platforms: C++

Model Documentation: Other Narrative Mathematical description

Model Code URLs: https://github.com/Lamarche-Perrin/multilevel_prediction

Abstract

Because the dynamics of complex systems is the result of both decisive local events and reinforced global effects, the prediction of such systems could not do without a genuine multilevel approach. This paper proposes to found such an approach on information theory. Starting from a complete microscopic description of the system dynamics, we are looking for observables of the current state that allows to efficiently predict future observables. Using the framework of the information bottleneck (IB) method, we relate optimality to two aspects: the complexity and the predictive capacity of the retained measurement. Then, with a focus on agent-based models (ABMs), we analyze the solution space of the resulting optimization problem in a generic fashion. We show that, when dealing with a class of feasible measurements that are consistent with the agent structure, this solution space has interesting algebraic properties that can be exploited to efficiently solve the problem. We then present results of this general framework for the voter model (VM) with several topologies and show that, especially when predicting the state of some sub-part of the system, multilevel measurements turn out to be the optimal predictors.

Tags

Complexity models Opinion dynamics networks