In the present paper a simple stochastic model of bureaucratic corruption is proposed. This model is based on the assumption that corruptional deals can be described as realizations of some random process on the graph, which defines the structure of pairwise connections between actors. By applying standard probabilistic techniques and arguments exact solutions for dimensionless corruption level, the main characteristic of the model, are obtained. Existence of stable communities of corrupted actors in the suggested model is investigated; dependence of probability of giant corruptional cluster emergence on basic model parameters is derived.
mathematical sociology, numerical simulation, random graphs
Mathematical modelling in actual problems of science and technics