Agent-based interpretations of classic network models

Authored by Federico Bergenti, Enrico Franchi, Agostino Poggi

Date Published: 2013-06

DOI: 10.1007/s10588-012-9150-x

Sponsors: No sponsors listed

Platforms: Java Python

Model Documentation: Other Narrative Pseudocode

Model Code URLs: Model code not found

Abstract

The paper is aimed at developing agent-based variants of traditional network models that make full use of concurrency. First, we review some classic models of the static structure of complex networks with the objective of developing agent-based models suited for simulating a large-scale, technology-enabled social network. Secondly, we outline the basic properties that characterize such networks. Then, we briefly discuss some classic network models and the properties of the networks they generate. Finally, we discuss how such models can be converted into agent-based models (i) to be executed more easily in heavily concurrent environments and (ii) to serve as basic blocks for more complex agent-based models. We evidence that many implicit assumptions made by traditional models regarding their execution environment are too expensive or outright impossible to maintain in concurrent environments. Consequently, we present the concurrency issues resulting from the violation of such assumptions. Then, we experimentally show that, under reasonable hypothesis, the agent-based variants maintain the main features of the classic models, notwithstanding the change of environment. Eventually, we present a meta-model that we singled out from the individual classic models and that we used to simplify the agent-oriented conversion of the traditional models. Finally, we discuss the software tools that we built to run the agent-based simulations.

Tags

Social networks Agent-based modeling Synthetic social network generation