Yongguang Yu

Wei Su, Xianzhong Chen, Yongguang Yu et al.

Designing feasible control strategies for opinion dynamics in complex social systems has never been an easy task. It requires a control protocol which 1) is not enforced on all individuals in the society, and 2) does not exclusively rely on specific opinion values shared by the social system. Thanks to the recent studies on noise-induced consensus in opinion dynamics, the noise-based intervention strategy has emerged as the only one meeting both of the above requirements, yet its underlying general theory is still lacking. In this paper, we perform rigorous theoretical analysis and simulations of a noise-based control strategy for opinion formation in which only a fraction of individuals is affected by randomly generated noise. We found that irrespective of the number of noise-driven individuals, including the case of only one single noise-affected individual, the system can attain a quasi-consensus in finite time, and the critical noise strength can be obtained. Our results highlight the efficiency of noise-driven mechanisms for the control of complex social dynamics.

Jiamin Wei, YangQuan Chen, Yongguang Yu et al.

Lévy flights is a random walk where the step-lengths have a probability distribution that is heavy-tailed. It has been shown that Lévy flights can maximize the efficiency of resource searching in uncertain environments, and also movements of many foragers and wandering animals have been shown to follow a Lévy distribution. The reason mainly comes from that the Lévy distribution, has an infinite second moment, and hence is more likely to generate an offspring that is farther away from its parent. However, the investigation into the efficiency of other different heavy-tailed probability distributions in swarm-based searches is still insufficient up to now. For swarm-based search algorithms, randomness plays a significant role in both exploration and exploitation, or diversification and intensification. Therefore, it's necessary to discuss the optimal randomness in swarm-based search algorithms. In this study, CS is taken as a representative method of swarm-based optimization algorithms, and the results can be generalized to other swarm-based search algorithms. In this paper, four different types of commonly used heavy-tailed distributions, including Mittag-Leffler distribution, Pareto distribution, Cauchy distribution, and Weibull distribution, are considered to enhance the searching ability of CS. Then four novel CS algorithms are proposed and experiments are carried out on 20 benchmark functions to compare their searching performances. Finally, the proposed methods are used to system identification to demonstrate the effectiveness.

Wei Su, Ge Chen, Yongguang Yu et al.

With the analysis of noise-induced synchronization of opinion dynamics with bounded confidence (BC), a natural and fundamental question is what opinion structures can be synchronized by noise. In the traditional Hegselmann-Krause (HK) model, each agent examines the opinion values of all the other ones and then choose neighbors to update its own opinion according to the BC scheme. In reality, people are more likely to interchange opinions with only some individuals, resulting in a predetermined local discourse relationship as introduced by the DeGroot model. In this paper, we consider an opinion dynamics that combines the schemes of BC and local discourse topology and investigate its synchronization induced by noise. The new model endows the heterogeneous HK model with a time-varying discourse topology. With the proposed definition of noise-synchronizability, it is shown that the compound noisy model is almost surely noise-synchronizable if and only if the time-varying discourse graph is uniformly jointly connected, taking the noise-induced synchronization of the classical heterogeneous HK model as a special case. As a natural implication, the result for the first time builds the equivalence between the connectivity of discourse graph and the beneficial effect of noise for opinion consensus.