The formation of information cocoons, driven by limited disclosure and individual preferences, has resulted in the polarization of society. However, the underlying mechanisms and pathways to escape these cocoons remain unresolved. This article aims to solve it by developing an adaptive imitation process. In this process, the measurement of information cocoons across the population is based on Shannon’s information entropy, taking into account neighborhood information. Incorporating the Dirac function to formulate information distribution over networks, theoretical results are validated by numerical simulation experiments. Results show that individual backgrounds and preferences are crucial factors in the formation of information cocoons, and the severity of information cocoon production increases with an individual capacity to stick to oneself. Encouraging connections among diverse communities can effectively mitigate the intensity of information cocoons. This research contributes to the advancement of computational communication systems and offers insights toward dismantling informational boundaries.

Emerging infectious diseases pose a growing threat to human society and have sparked extensive public discussions on social media. Although numerous efforts have been made in health data mining on social media, there is a lack of focus on quantitative comparisons across multiple platforms, despite their crucial role in the holistic social communication system. This study addresses this gap by developing a generalized regression model that considers the distinct attributes of social media platforms, including short-text, long-text, and Eastern or Western orientation. Using Monkeypox as an application case, this study examines differences among platforms based on four factors: user characteristics, text topics, text emotion, and text quality. The modeling and regression results reveal significant heterogeneity in public opinion expressions across different platforms, particularly between long-text and short-text platforms. Users on short-text platforms are more exposed to diverse information and tend to be susceptible to emotionally provocative content. On the other hand, users on long-text platforms prefer in-depth discussions and show greater receptivity to content infused with positive emotions. This study reveals the information bias brought by platform differences and contributes to data-driven modeling in social communication systems.

Online social media have aroused much research interest in recent years. In contrast to previous work that focused on the detection of emerging topics, this article undertakes the prediction of active users in online social events, which is so far rarely explored. This prediction task is formulated as a binary classification problem that built on real-world tweet streams, taking Ferguson event and New York Chockhold event as examples. Then, a comprehensive user feature system is designed to characterize the events’ online participants, which includes not only basic statistical characteristics and image-pixel-level features, but also some emotional features and personality features. Next, the Weighted Random Forest (Weighted-RF) classifier is adopted to solve the classification problem. Based on the user feature system and the classifier, the experience of a previous event can be archived and applied to the prediction of later similar events. Experimental results show that the Weighted-RF trained by samples of Ferguson event can effectively predict active users in NYC event, with an AUC value around 0.8392. Besides, the image-content based personality model provides a new tool for depicting user portraits, which further contributes to the quantitative analysis of online social events.

The control of virus spreading over complex networks with a limited budget has attracted much attention but remains challenging. This article aims at addressing the combinatorial, discrete resource allocation problems (RAPs) in virus spreading control. To meet the challenges of increasing network scales and improve the solving efficiency, an evolutionary divide-and-conquer algorithm is proposed, namely, a coevolutionary algorithm with network-community-based decomposition (NCD-CEA). It is characterized by the community-based dividing technique and cooperative coevolution conquering thought. First, to reduce the time complexity, NCD-CEA divides a network into multiple communities by a modified community detection method such that the most relevant variables in the solution space are clustered together. The problem and the global swarm are subsequently decomposed into subproblems and subswarms with low-dimensional embeddings. Second, to obtain high-quality solutions, an alternative evolutionary approach is designed by promoting the evolution of subswarms and the global swarm, in turn, with subsolutions evaluated by local fitness functions and global solutions evaluated by a global fitness function. Extensive experiments on different networks show that NCD-CEA has a competitive performance in solving RAPs. This article advances toward controlling virus spreading over large-scale networks.

The control of epidemics taking place in complex networks has been an increasingly active topic in public health management. In this article, we propose an efficient networked epidemic control system, where a modified susceptible-exposed-infected-vigilant (SEIV) model is first built to simulate epidemic spreading. Then, different from existing continuous resource models which abstractly map resources to parameters of epidemic models, a concrete resource description model is built to simulate real-world goods/services and their allocation. Based on the two models, a cost-constraint subset selection problem in epidemic control is identified. To solve the problem, a swarm-based stochastic optimization policy is proposed, where each particle in the swarm can determine its own solutions according to the guidance of its superior peers and historical searching experience of the whole swarm, without extra problem-relative information. Theoretical proof about system equilibrium is provided, which is consistent with experimental observations. The competitive performance of the proposed optimizer is validated by theoretical analysis and comparison experiments. Finally, an application case is provided to illustrate the practicability.

The allocation of epidemic-control resources has been an increasingly active topic in the physical world. Most existing studies focus on the allocation of abstract and continuous epidemic control resources, and then formulate differentiable convex programming problems. However, real-world resources are usually discrete materials, goods, or services, so that resource allocation problems become non-convex. As a complementary study, this paper builds three discrete resource allocation problems based on an improved Susceptible-Exposed-Infectious- Vigilant (SEIV) spread model: the cost-constraint optimization problem (CCOP), rate-constraint optimization problem (RCOP), and eradication optimization problem (EOP). Then, existing swarm-based metaheuristic algorithms are adapted to effectively solve the problems. Thereinto, the Heuristic Majority-Voting Binary Particle Swarm Optimizer (HMV-BPSO) is present, which introduces a heuristic factor which concerns the probability distribution of resources to guide the evolution of particles and helps improve the performance of original MV-BPSO. Numerical experiments are developed to verify the effectiveness of swarm- based metaheuristic algorithms on epidemic control. Results show that HMV-BPSO can produce higher-quality solutions than other algorithms.