Abstract:
A model of behavior strategies evolution in social networks with arbitrary topology is proposed. The model is formalized as a discrete dynamical system on graph, which defines the scheme of possible interactions between elements of the system. Typical evolutionary scenarios are described on qualitative level. A simple generalization of the model, which allows to model evolution of graph topology induced by elements dynamics, is also discussed. Applications of the proposed model to the problem of corruption simulation are considered.