Analysing and controlling the tax evasion dynamics via majority-vote model

TL;DR

This paper demonstrates that the Zaklan model of tax evasion dynamics is robust across different network topologies and can be effectively simulated using the non-equilibrium majority-vote model near its critical noise level.

Contribution

It introduces the application of the non-equilibrium majority-vote model to the Zaklan tax evasion model across various network structures, expanding the understanding of its robustness.

Findings

The Zaklan model is robust on different network topologies.

The majority-vote model reproduces tax evasion dynamics near critical noise.

The model's behavior is consistent with previous equilibrium Ising model results.

Abstract

Within the context of agent-based Monte-Carlo simulations, we study the well-known majority-vote model (MVM) with noise applied to tax evasion on simple square lattices, Voronoi-Delaunay random lattices, Barabasi-Albert networks, and Erd\"os-R\'enyi random graphs. In the order to analyse and to control the fluctuations for tax evasion in the economics model proposed by Zaklan, MVM is applied in the neighborhod of the noise critical $q_{c}$. The Zaklan model had been studied recently using the equilibrium Ising model. Here we show that the Zaklan model is robust and can be reproduced also through the nonequilibrium MVM on various topologies.