Analysis of consensus time and winning rate in two-layer networks with hypocrisy of different structures
Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, Tome 20 (2024) no. 2, pp. 170-192

Voir la notice de l'article provenant de la source Math-Net.Ru

We have developed a microscopic version of general concealed voter model (GCVM). Original GCVM uses only statistical-physical methods, while our new approach starts with a real network. A microscopic model is suitable for any two-layer network (with internal and external layers) satisfying the definition given in the paper. We conduct a series of simulations with different network structures and found that a cyclic external structure prolongs consensus time in comparison with a complete external structure. Moreover, a cyclic external structure has a positive impact on a winning rate, and this result is different from the one obtained in the macroscopic version of GCVM. The possible reasons for this difference are discussed in the paper. Additionally, we propose and validate the hypothesis that there exists a strong linear relationship between a consensus time and pairwise average shortest paths $d$ in the network structure. We performed a controlled variable approach to validate the impact of each individual parameter on key performance indicators (KPIs) including a consensus time and winning rate. Furthermore, we assess the influence of parameter combinations on KPIs by analyzing the results using the $K$-means algorithm. We conclude that certain parameter combinations can have a significant impact on the consensus time.
Keywords: opinion dynamics, voter model, concealed voter model, general concealed voter model, winning rate.
@article{VSPUI_2024_20_2_a3,
     author = {Ch. Zhao and E. M. Parilina},
     title = {Analysis of consensus time and winning rate in two-layer networks with hypocrisy of different structures},
     journal = {Vestnik Sankt-Peterburgskogo universiteta. Prikladna\^a matematika, informatika, processy upravleni\^a},
     pages = {170--192},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2024},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VSPUI_2024_20_2_a3/}
}
TY  - JOUR
AU  - Ch. Zhao
AU  - E. M. Parilina
TI  - Analysis of consensus time and winning rate in two-layer networks with hypocrisy of different structures
JO  - Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
PY  - 2024
SP  - 170
EP  - 192
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VSPUI_2024_20_2_a3/
LA  - en
ID  - VSPUI_2024_20_2_a3
ER  - 
%0 Journal Article
%A Ch. Zhao
%A E. M. Parilina
%T Analysis of consensus time and winning rate in two-layer networks with hypocrisy of different structures
%J Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
%D 2024
%P 170-192
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VSPUI_2024_20_2_a3/
%G en
%F VSPUI_2024_20_2_a3
Ch. Zhao; E. M. Parilina. Analysis of consensus time and winning rate in two-layer networks with hypocrisy of different structures. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, Tome 20 (2024) no. 2, pp. 170-192. http://geodesic.mathdoc.fr/item/VSPUI_2024_20_2_a3/