Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userWeighted hypersoft configuration model
216
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration models. If the degree sequence is constrained exactly, the corresponding microcanonical ensemble of random graphs with a given degree sequence is the configuration model per se. If the degree sequence is constrained only on average, the corresponding grand-canonical ensemble of random graphs with a given expected degree sequence is the soft configuration model. If the degree sequence is not fixed at all but randomly drawn from a fixed distribution, the corresponding hypercanonical ensemble of random graphs with a given degree distribution is the hypersoft configuration model, a more adequate description of dynamic real-world networks in which degree sequences are never fixed but degree distributions often stay stable. Here, we introduce the hypersoft configuration model of weighted networks. The main contribution is a particular version of the model with power-law degree and strength distributions, and superlinear scaling of strengths with degrees, mimicking the properties of some real-world networks. As a byproduct, we generalize the notions of sparse graphons and their entropy to weighted networks.
rate research
Read More
We investigate the effect of a specific edge weighting scheme $sim (k_i k_j)^{beta}$ on distributed flow efficiency and robustness to cascading failures in scale-free networks. In particular, we analyze a simple, yet fundamental distributed flow model: current flow in random resistor networks. By the tuning of control parameter $beta$ and by considering two general cases of relative node processing capabilities as well as the effect of bandwidth, we show the dependence of transport efficiency upon the correlations between the topology and weights. By studying the severity of cascades for different control parameter $beta$, we find that network resilience to cascading overloads and network throughput is optimal for the same value of $beta$ over the range of node capacities and available bandwidth.
Models of disease spreading are critical for predicting infection growth in a population and evaluating public health policies. However, standard models typically represent the dynamics of disease transmission between individuals using macroscopic parameters that do not accurately represent person-to-person variability. To address this issue, we present a dynamic network model that provides a straightforward way to incorporate both disease transmission dynamics at the individual scale as well as the full spatiotemporal history of infection at the population scale. We find that disease spreads through a social network as a traveling wave of infection, followed by a traveling wave of recovery, with the onset and dynamics of spreading determined by the interplay between disease transmission and recovery. We use these insights to develop a scaling theory that predicts the dynamics of infection for diverse diseases and populations. Furthermore, we show how spatial heterogeneities in susceptibility to infection can either exacerbate or quell the spread of disease, depending on its infectivity. Ultimately, our dynamic network approach provides a simple way to model disease spreading that unifies previous findings and can be generalized to diverse diseases, containment strategies, seasonal conditions, and community structures.
In this work we study opinion formation in a population participating of a public debate with two distinct choices. We considered three distinct mechanisms of social interactions and individuals behavior: conformity, nonconformity and inflexibility. The conformity is ruled by the majority-rule dynamics, whereas the nonconformity is introduced in the population as an independent behavior, implying the failure to attempted group influence. Finally, the inflexible agents are introduced in the population with a given density. These individuals present a singular behavior, in a way that their stubbornness makes them reluctant to change their opinions. We consider these effects separately and all together, with the aim to analyze the critical behavior of the system. We performed numerical simulations in some lattice structures and for distinct population sizes, and our results suggest that the different formulations of the model undergo order-disorder phase transitions in the same universality class of the Ising model. Some of our results are complemented by analytical calculations.
We propose a generalized framework for the study of voter models in complex networks at the the heterogeneous mean-field (HMF) level that (i) yields a unified picture for existing copy/invasion processes and (ii) allows for the introduction of further heterogeneity through degree-selectivity rules. In the context of the HMF approximation, our model is capable of providing straightforward estimates for central quantities such as the exit probability and the consensus/fixation time, based on the statistical properties of the complex network alone. The HMF approach has the advantage of being readily applicable also in those cases in which exact solutions are difficult to work out. Finally, the unified formalism allows one to understand previously proposed voter-like processes as simple limits of the generalized model.
In this work we study a modified Susceptible-Infected-Susceptible (SIS) model in which the infection rate $lambda$ decays exponentially with the number of reinfections $n$, saturating after $n=l$. We find a critical decaying rate $epsilon_{c}(l)$ above which a finite fraction of the population becomes permanently infected. From the mean-field solution and computer simulations on hypercubic lattices we find evidences that the upper critical dimension is 6 like in the SIR model, which can be mapped in ordinary percolation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
