Memory has a great impact on the evolution of every process related to human societies. Among them, the evolution of an epidemic is directly related to the individuals' experiences. Indeed, any real epidemic process is clearly sustained by a non-Markovian dynamics: memory effects play an essential role in the spreading of diseases. Including memory effects in the susceptible-infected-recovered (SIR) epidemic model seems very appropriate for such an investigation. Thus, the memory prone SIR model dynamics is investigated using fractional derivatives. The decay of long-range memory, taken as a power-law function, is directly controlled by the order of the fractional derivatives in the corresponding nonlinear fractional differential evolution equations. Here we assume "fully mixed" approximation and show that the epidemic threshold is shifted to higher values than those for the memoryless system, depending on this memory "length" decay exponent. We also consider the SIR model on structured networks and study the effect of topology on threshold points in a non-Markovian dynamics. Furthermore, the lack of access to the precise information about the initial conditions or the past events plays a very relevant role in the correct estimation or prediction of the epidemic evolution. Such a "constraint" is analyzed and discussed.
We generalize the theory of k-core percolation on complex networks to k-core percolation on multiplex networks, where k≡(k(1),k(2),...,k(M)). Multiplex networks can be defined as networks with vertices of one kind but M different types of edges, representing different types of interactions. For such networks, the k-core is defined as the largest subgraph in which each vertex has at least k(i) edges of each type, i=1,2,...,M. We derive self-consistency equations to obtain the birth points of the k-cores and their relative sizes for uncorrelated multiplex networks with an arbitrary degree distribution. To clarify our general results, we consider in detail multiplex networks with edges of two types and solve the equations in the particular case of Erdős-Rényi and scale-free multiplex networks. We find hybrid phase transitions at the emergence points of k-cores except the (1,1)-core for which the transition is continuous. We apply the k-core decomposition algorithm to air-transportation multiplex networks, composed of two layers, and obtain the size of (k(1),k(2))-cores.
We check the universality properties of the two-dimensional Abelian sandpile model by computing some of its properties on the honeycomb lattice. Exact expressions for unit height correlation functions in presence of boundaries and for different boundary conditions are derived. Also, we study the statistics of the boundaries of avalanche waves by using the theory of SLE and suggest that these curves are conformally invariant and described by SLE 2 .
We introduce a k-leaf removal algorithm as a generalization of the so-called leaf removal algorithm. In this pruning algorithm, vertices of degree smaller than k, together with their first nearest neighbors and all incident edges are progressively removed from a random network. As the result of this pruning the network is reduced to a subgraph which we call the Generalized k-core (Gkcore). Performing this pruning for the sequence of natural numbers k, we decompose the network into a hierarchy of progressively nested Gk-cores. We present an analytical framework for description of Gk-core percolation for undirected uncorrelated networks with arbitrary degree distributions (configuration model). To confirm our results, we also derive rate equations for the k-leaf removal algorithm which enable us to obtain the structural characteristics of the Gk-cores in another way. Also we apply our algorithm to a number of real-world networks and perform the Gk-core decomposition for them.
The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric co-infection model for spreading of two diseases on a twolayer multiplex network. We allow layer overlapping, but we assume that each layer is random and locally loop-less. Infection with one of the diseases increases the probability of getting infected with the other. Using the generating function method, we calculate exactly the fraction of individuals infected with both diseases (so-called co-infected clusters) in the stationary state, as well as the epidemic spreading thresholds and the phase diagram of the model. With increasing cooperation, we observe a tricritical point and the type of transition changes from continuous to hybrid. Finally, we compare the co-infected clusters in the case of co-operating diseases with the so-called "viable" clusters in networks with dependencies.
Most studies of disease spreading consider the underlying social network as obtained without the contagion, though epidemic influences people's willingness to contact others: A "friendly" contact may be turned to "unfriendly" to avoid infection. We study the susceptible-infected disease-spreading model on signed networks, in which each edge is associated with a positive or negative sign representing the friendly or unfriendly relation between its end nodes. In a signed network, according to Heider's theory, edge signs evolve such that finally a state of structural balance is achieved, corresponding to no frustration in physics terms. However, the danger of infection affects the evolution of its edge signs. To describe the coupled problem of the sign evolution and disease spreading, we generalize the notion of structural balance by taking into account the state of the nodes. We introduce an energy function and carry out Monte Carlo simulations on complete networks to test the energy landscape, where we find local minima corresponding to the so-called jammed states. We study the effect of the ratio of initial friendly to unfriendly connections on the propagation of disease. The steady state can be balanced or a jammed state such that a coexistence occurs between susceptible and infected nodes in the system.
We describe the complex global structure of giant components in directed multiplex networks which generalizes the well-known bow-tie structure, generic for ordinary directed networks. By definition, a directed multiplex network contains vertices of one type and directed edges of m different types. In directed multiplex networks, we distinguish a set of different giant components based on the existence of directed paths of different types between their vertices, such that for each type of edges, the paths run entirely through only edges of that type. If, in particular, m = 2, we define a strongly viable component as a set of vertices, in which for each type of edges, each two vertices are interconnected by at least two directed paths in both directions, running through the edges of only this type. We show that in this case, a directed multiplex network contains, in total, 9 different giant components including the strongly viable component. In general, the total number of giant components is 3 m . For uncorrelated directed multiplex networks, we obtain exactly the size and the emergence point of the strongly viable component and estimate the sizes of other giant components.
The recursive removal of leaves (dead end vertices) and their neighbors from an undirected network results, when this pruning algorithm stops, in a so-called core of the network. This specific subgraph should be distinguished from k-cores, which are principally different subgraphs in networks. If the vertex mean degree of a network is sufficiently large, the core is a giant cluster containing a finite fraction of vertices. We find that generalization of this pruning algorithm to directed networks provides a significantly more complex picture of cores. By implementing a rate equation approach to this pruning procedure for directed uncorrelated networks, we identify a set of cores progressively embedded into each other in a network and describe their birth points and structure.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.