TY - JOUR
T1 - An information propagation model for social networks based on continuous-time quantum walk
AU - Yan, Fei
AU - Liang, Wen
AU - Hirota, Kaoru
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
PY - 2022/8
Y1 - 2022/8
N2 - Existing social network simulation models exhibit several limitations, including extensive iteration requirements and multiple control parameters. In this study, an information propagation model based on continuous-time quantum walk (CTQW-IPM) is introduced to rank crucial individuals in undirected social networks. In the proposed CTQW-IPM, arbitrary individuals (or groups) can be specified as initial diffusion dynamic elements through preset probability amplitudes. Information diffusion on a global reachable path is then simulated by an evolution operator, as individual degrees of cruciality are estimated from probability distributions acquired from quantum observations. CTQW-IPM does not require iterations, due to the non-randomness of CTQW, and does not include extensive computations as complex cascade diffusion processes are replaced by evolution operators. Experimental comparisons of CTQW-IPM and several conventional models showed their ranking of crucial individuals exhibited a strong correlation, with nearly every individual in the social network assigned a unique measured value based on the rate of distinguishability. CTQW-IPM also outperformed other algorithms in influence maximization problems, as measured by the resulting spread size.
AB - Existing social network simulation models exhibit several limitations, including extensive iteration requirements and multiple control parameters. In this study, an information propagation model based on continuous-time quantum walk (CTQW-IPM) is introduced to rank crucial individuals in undirected social networks. In the proposed CTQW-IPM, arbitrary individuals (or groups) can be specified as initial diffusion dynamic elements through preset probability amplitudes. Information diffusion on a global reachable path is then simulated by an evolution operator, as individual degrees of cruciality are estimated from probability distributions acquired from quantum observations. CTQW-IPM does not require iterations, due to the non-randomness of CTQW, and does not include extensive computations as complex cascade diffusion processes are replaced by evolution operators. Experimental comparisons of CTQW-IPM and several conventional models showed their ranking of crucial individuals exhibited a strong correlation, with nearly every individual in the social network assigned a unique measured value based on the rate of distinguishability. CTQW-IPM also outperformed other algorithms in influence maximization problems, as measured by the resulting spread size.
KW - Crucial individual
KW - Influence maximization
KW - Information propagation
KW - Quantum walk
KW - Social network
UR - http://www.scopus.com/inward/record.url?scp=85127240792&partnerID=8YFLogxK
U2 - 10.1007/s00521-022-07168-7
DO - 10.1007/s00521-022-07168-7
M3 - Article
AN - SCOPUS:85127240792
SN - 0941-0643
VL - 34
SP - 13455
EP - 13468
JO - Neural Computing and Applications
JF - Neural Computing and Applications
IS - 16
ER -