Epidemic dynamics on higher-dimensional small world networks

Network Spreading from Network Dimension

Continuous-state network spreading models provide critical numerical and analytic insights into transmission processes in epidemiology, rumor propagation, knowledge dissemination, and many other areas. Most of these models reflect only local features such as adjacency, degree, and transitivity, so can exhibit substantial error in the presence of global correlations typical of empirical networks. Here, we propose mitigating this limitation via a network property ideally suited to capturing spreading. This is the network correlation dimension, which characterizes how the number of nodes within range of a source typically scales with distance. Applying the approach to susceptible-infected-recovered processes leads to a spreading model which, for a wide range of networks and epidemic parameters, can provide more accurate predictions of the early stages of a spreading process than important established models of substantially higher complexity. In addition, the proposed model leads to a basic reproduction number that provides information about the final state not available from popular established models.

Modeling and analyzing an opinion network dynamics considering the environmental factor

With the development of Internet technology, social media has gradually become an important platform where users can express opinions about hot events. Research on the mechanism of public opinion evolution is beneficial to guide the trend of opinions, making users' opinions change in a positive direction or reach a consensus among controversial crowds. To design effective strategies for public opinion management, we propose a dynamic opinion network susceptible-forwarding-immune model considering environmental factors (NET-OE-SFI), which divides the forwarding nodes into two types: support and opposition based on the real data of users. The NET-OE-SFI model introduces environmental factors from infectious diseases into the study of network information transmission, which aims to explore the evolution law of users' opinions affected by the environment. We attempt to combine the complex media environmental factors in social networks with users' opinion information to study the influence of environmental factors on the evolution of public opinion. Data fitting of real information transmission data fully demonstrates the validity of this model. We have also made a variety of sensitivity analysis experiments to study the influence of model parameters, contributing to the design of reasonable and effective strategies for public opinion guidance.

Hub-collision avoidance and leaf-node options algorithm for fractal dimension and renormalization of complex networks

The box-covering method plays a fundamental role in the fractal property recognition and renormalization analysis of complex networks. This study proposes the hub-collision avoidance and leaf-node options (HALO) algorithm. In the box sampling process, a forward sampling rule (for avoiding hub collisions) and a reverse sampling rule (for preferentially selecting leaf nodes) are determined for bidirectional network traversal to reduce the randomness of sampling. In the box selection process, the larger necessary boxes are preferentially selected to join the solution by continuously removing small boxes. The compact-box-burning (CBB) algorithm, the maximum-excluded-mass-burning (MEMB) algorithm, the overlapping-box-covering (OBCA) algorithm, and the algorithm for combining small-box-removal strategy and maximum box sampling with a sampling density of 30 (SM30) are compared with HALO in experiments. Results on nine real networks show that HALO achieves the highest performance score and obtains 11.40%, 7.67%, 2.18%, and 8.19% fewer boxes than the compared algorithms, respectively. The algorithm determinism is significantly improved. The fractal dimensions estimated by covering four standard networks are more accurate. Moreover, different from MEMB or OBCA, HALO is not affected by the tightness of the hubs and exhibits a stable performance in different networks. Finally, the time complexities of HALO and the compared algorithms are all O(N²), which is reasonable and acceptable.

Epidemic Dynamics of Two-Pathogen Spreading for Pairwise Models

In the real world, pathogens do not exist in isolation. The transmission of one pathogen may be affected by the presence of other pathogens, and certain pathogens generate multiple strains with different spreading features. Hence, the behavior of multi-pathogen transmission has attracted much attention in epidemiological research. In this paper, we use the pairwise approximation method to formulate two-pathogen models capturing cross-immunity, super-infection, and co-infection phenomena, in which each pathogen follows a susceptible-infected-susceptible (SIS) mechanism. For each model, we calculate the basic reproduction number and analyze the stability of equilibria, and discuss the differences from the mean-field approach. We demonstrate that simulations are in good agreement with the analytical results.