Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSharp Thresholds for a SIR Model on One-Dimensional Small-World Networks
71
0
0.0
(
0
)
Added by
Riccardo Denni
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We study epidemic spreading according to a emph{Susceptible-Infectious-Recovered} (for short, emph{SIR}) network model known as the {em Reed-Frost} model, and we establish sharp thresholds for two generative models of {em one-dimensional small-world graphs}, in which graphs are obtained by adding random edges to a cycle. In $3$-regular graphs obtained as the union of a cycle and a random perfect matching, we show that there is a sharp threshold at $.5$ for the contagion probability along edges. In graphs obtained as the union of a cycle and of a $mathcal{G}_{n,c/n}$ ErdH{o}s-Renyi random graph with edge probability $c/n$, we show that there is a sharp threshold $p_c$ for the contagion probability: the value of $p_c$ turns out to be $sqrt 2 -1approx .41$ for the sparse case $c=1$ yielding an expected node degree similar to the random $3$-regular graphs above. In both models, below the threshold we prove that the infection only affects $mathcal{O}(log n)$ nodes, and that above the threshold it affects $Omega(n)$ nodes. These are the first fully rigorous results establishing a phase transition for SIR models (and equivalent percolation problems) in small-world graphs. Although one-dimensional small-world graphs are an idealized and unrealistic network model, a number of realistic qualitative phenomena emerge from our analysis, including the spread of the disease through a sequence of local outbreaks, the danger posed by random connections, and the effect of super-spreader events.
rate research
Read More
We consider the Maki-Thompson model for the stochastic propagation of a rumour within a population. We extend the original hypothesis of homogenously mixed population by allowing for a small-world network embedding the model. This structure is realized starting from a $k$-regular ring and by inserting, in the average, $c$ additional links in such a way that $k$ and $c$ are tuneable parameter for the population architecture. We prove that this system exhibits a transition between regimes of localization (where the final number of stiflers is at most logarithmic in the population size) and propagation (where the final number of stiflers grows algebraically with the population size) at a finite value of the network parameter $c$. A quantitative estimate for the critical value of $c$ is obtained via extensive numerical simulations.
We investigate the Gibbs properties of the fuzzy Potts model on the d-dimensional torus with Kac interaction. We use a variational approach for profiles inspired by that of Fernandez, den Hollander and Mart{i}nez for their study of the Gibbs-non-Gibbs transitions of a dynamical Kac-Ising model on the torus. As our main result, we show that the mean-field thresholds dividing Gibbsian from non-Gibbsian behavior are sharp in the fuzzy Kac-Potts model with class size unequal two. On the way to this result we prove a large deviation principle for color profiles with diluted total mass densities and use monotocity arguments.
A dissipative sandpile model (DSM) is constructed and studied on small world networks (SWN). SWNs are generated adding extra links between two arbitrary sites of a two dimensional square lattice with different shortcut densities $phi$. Three different regimes are identified as regular lattice (RL) for $philesssim 2^{-12}$, SWN for $2^{-12}<phi< 0.1$ and random network (RN) for $phige 0.1$. In the RL regime, the sandpile dynamics is characterized by usual Bak, Tang, Weisenfeld (BTW) type correlated scaling whereas in the RN regime it is characterized by the mean field (MF) scaling. On SWN, both the scaling behaviors are found to coexist. Small compact avalanches below certain characteristic size $s_c$ are found to belong to the BTW universality class whereas large, sparse avalanches above $s_c$ are found to belong to the MF universality class. A scaling theory for the coexistence of two scaling forms on SWN is developed and numerically verified. Though finite size scaling (FSS) is not valid for DSM on RL as well as on SWN, it is found to be valid on RN for the same model. FSS on RN is appeared to be an outcome of super diffusive sand transport and uncorrelated toppling waves.
A dissipative stochastic sandpile model is constructed on one and two dimensional small-world networks with different shortcut densities $phi$ where $phi=0$ and $1$ represent a regular lattice and a random network respectively. In the small-world regime ($2^{-12} le phi le 0.1$), the critical behaviour of the model is explored studying different geometrical properties of the avalanches as a function of avalanche size $s$. For both the dimensions, three regions of $s$, separated by two crossover sizes $s_1$ and $s_2$ ($s_1<s_2$), are identified analyzing the scaling behaviour of average height and area of the toppling surface associated with an avalanche. It is found that avalanches of size $s<s_1$ are compact and follow Manna scaling on the regular lattice whereas the avalanches with size $s>s_1$ are sparse as they are on network and follow mean-field scaling. Coexistence of different scaling forms in the small-world regime leads to violation of usual finite-size scaling, in contrary to the fact that the model follows the same on the regular lattice as well as on the random network independently. Simultaneous appearance of multiple scaling forms are characterized by developing a coexistence scaling theory. As SWN evolves from regular lattice to random network, a crossover from diffusive to super-diffusive nature of sand transport is observed and scaling forms of such crossover is developed and verified.
Mapping a complex network to an atomic cluster, the Anderson localization theory is used to obtain the load distribution on a complex network. Based upon an intelligence-limited model we consider the load distribution and the congestion and cascade failures due to attacks and occasional damages. It is found that the eigenvector centrality (EC) is an effective measure to find key nodes for traffic flow processes. The influence of structure of a WS small-world network is investigated in detail.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
