Open AccessALGORITHM FOR IDENTIFYING GRAPH OF CLOSED TRANSACTIONS BETWEEN ECONOMIC AGENTS
Author(s) -
A. A. Panachev,
Ekaterina Adiyak,
Д. Б. Берг
Publication year - 2021
Publication title -
vestnik astrahanskogo gosudarstvennogo tehničeskogo universiteta. seriâ: upravlenie, vyčislitelʹnaâ tehnika i informatika
Language(s) - English
Resource type - Journals
eISSN - 2224-9761
pISSN - 2072-9502
DOI - 10.24143/2072-9502-2021-3-94-104
Subject(s) - multinomial distribution , identification (biology) , computer science , population , graph , object (grammar) , bernoulli's principle , business , data mining , theoretical computer science , artificial intelligence , econometrics , economics , sociology , engineering , demography , botany , biology , aerospace engineering
The article considers developing the algorithm of local economic communities’ identification on the municipal union territory. The description of authors’ algorithm is presented. The algorithm was tested on the real object of research. Searching of local entrepreneurs’ communities was conducted in the city with population of 59,000 citizens. The analyses were made according to sampling of 12, 000 transactions between 2 933 organizations during one month in 4 bank branches. There were found 17 closed networks with 102 organization-participants. The largest network of agents consists of 59 organizations-participants. The comparison of the largest network with random graphs (Bernoulli, Multinomial) showed that the structure is formed not randomly