Influence maximization in a social network refers to the selection of node sets that support the fastest and broadest propagation of information under a chosen transmission model. The efficient identification of such influence-maximizing groups is an active area of research with diverse practical relevance. Greedy-based methods can provide solutions of reliable accuracy, but the computational cost of the required Monte Carlo simulations renders them infeasible for large networks. Meanwhile, although network structure-based centrality methods can be efficient, they typically achieve poor recognition accuracy. Here, we establish an effective influence assessment model based both on the total valuation and variance in valuation of neighbor nodes, motivated by the possibility of unreliable communication channels. We then develop a discrete moth-flame optimization method to search for influence-maximizing node sets, using a local crossover and mutation evolution scheme atop the canonical moth position updates. To accelerate convergence, a search area selection scheme derived from a degree-based heuristic is used. The experimental results on five real-world social networks, comparing our proposed method against several alternatives in the current literature, indicates our approach to be effective and robust in tackling the influence maximization problem.

Rumor spreading can have a significant impact on people’s lives, distorting scientific facts and influencing political opinions. With technologies that have democratized the production and reproduction of information, the rate at which misinformation can spread has increased significantly, leading many to describe contemporary times as a ‘post-truth era’. Research into rumor spreading has primarily been based on either model of social and biological contagion, or upon models of opinion dynamics. Here we present a comprehensive model that is based on information entropy, which allows for the incorporation of considerations like the role of memory, conformity effects, differences in the subjective propensity to produce distortions, and variations in the degree of trust that people place in each other. Variations in the degree of trust are controlled by a confidence factor β, while the propensity to produce distortions is controlled by a conservation factor K. Simulations were performed using a Barabási–Albert (BA) scale-free network seeded with a single piece of information. The influence of β and K upon the temporal evolution of the system was subsequently analyzed regarding average information entropy, opinion fragmentation, and the range of rumor spread. These results can aid in decision-making to limit the spread of rumors.

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed.

This article investigates the $\mathcal {H}_{\infty }$ synchronization problem for fuzzy coupled neural networks subject to reaction–diffusion. An available control method, namely, the adaptive pinning control strategy, is employed. In view of such a method, one may accomplish control objectives by controlling a small number of nodes instead of all nodes, and in this regard, it is possible to reduce the control cost to some extent, and the method can adaptively adjust the coupling strength as well. Furthermore, a novel inequality is introduced, which can ensure that the developed results are less conservative compared with some existing ones of dealing with the reaction–diffusion terms. Then, through the utilization of fuzzy set theory together with Lyapunov stability theory, some sufficient conditions with the ability to ensure the $\mathcal {H}_{\infty }$ performance level of the resulting synchronization error system are deduced. Finally, an illustrative example is presented to show the advantages and effectiveness of the proposed methods.

Electroencephalography (EEG) is a complex bioelectrical signal. Analysis of which can provide researchers with useful physiological information. In order to recognize and classify EEG signals, a pattern recognition method for optimizing the support vector machine (SVM) by using improved squirrel search algorithm (ISSA) is proposed. The EEG signal is preprocessed, with its time domain features being extracted and directed to the SVM as feature vectors for classification and identification. In this paper, the method of good point set is used to initialize the population position, chaos and reverse learning mechanism are introduced into the algorithm. The performance test of the improved squirrel algorithm (ISSA) is carried out by using the benchmark function. As can be seen from the statistical analysis of the results, the exploration ability and convergence speed of the algorithm are improved. This is then used to optimize SVM parameters. ISSA-SVM model is established and built for classification of EEG signals, compared with other common SVM parameter optimization models. For data sets, the average classification accuracy of this method is 85.9%. This result is an improvement of 2–5% over the comparison method.

Parrondo’s games were first constructed using a simple tossing scenario, which demonstrates the following paradoxical situation: in sequences of games, a winning expectation may be obtained by playing the games in a random order, although each game (game A or game B) in the sequence may result in losing when played individually. The available Parrondo’s games based on the spatial niche (the neighboring environment) are applied in the regular networks. The neighbors of each node are the same in the regular graphs, whereas they are different in the complex networks. Here, Parrondo’s model based on complex networks is proposed, and a structure of game B applied in arbitrary topologies is constructed. The results confirm that Parrondo’s paradox occurs. Moreover, the size of the region of the parameter space that elicits Parrondo’s paradox depends on the heterogeneity of the degree distributions of the networks. The higher heterogeneity yields a larger region of the parameter space where the strong paradox occurs. In addition, we use scale-free networks to show that the network size has no significant influence on the region of the parameter space where the strong or weak Parrondo’s paradox occurs. The region of the parameter space where the strong Parrondo’s paradox occurs reduces slightly when the average degree of the network increases.