Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA dynamic network in a dynamic population: asymptotic properties
176
0
0.0
(
0
)
Added by
Tom Britton
Publication date
2011
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We derive asymptotic properties for a stochastic dynamic network model in a stochastic dynamic population. In the model, nodes give birth to new nodes until they die, each node being equipped with a social index given at birth. During the life of a node it creates edges to other nodes, nodes with high social index at higher rate, and edges disappear randomly in time. For this model we derive criterion for when a giant connected component exists after the process has evolved for a long period of time, assuming the node population grows to infinity. We also obtain an explicit expression for the degree correlation $rho$ (of neighbouring nodes) which shows that $rho$ is always positive irrespective of parameter values in one of the two treated submodels, and may be either positive or negative in the other model, depending on the parameters.
rate research
Read More
An adaptive network model using SIS epidemic propagation with link-type dependent link activation and deletion is considered. Bifurcation analysis of the pairwise ODE approximation and the network-based stochastic simulation is carried out, showing that three typical behaviours may occur; namely, oscillations can be observed besides disease-free or endemic steady states. The oscillatory behaviour in the stochastic simulations is studied using Fourier analysis, as well as through analysing the exact master equations of the stochastic model. A compact pairwise approximation for the dynamic network case is also developed and, for the case of link-type independent rewiring, the outcome of epidemics and changes in network structure are concurrently presented in a single bifurcation diagram. By going beyond simply comparing simulation results to mean-field models, our approach yields deeper insights into the observed phenomena and help better understand and map out the limitations of mean-field models.
We study properties of some standard network models when the population is split into two types and the connection pattern between the types is varied. The studied models are generalizations of the ErdH{o}s-R{e}nyi graph, the configuration model and a preferential attachment graph. For the ErdH{o}s-R{e}nyi graph and the configuration model, the focus is on the component structure. We derive expressions for the critical parameter, indicating when there is a giant component in the graph, and study the size of the largest component by aid of simulations. When the expected degrees in the graph are fixed and the connections are shifted so that more edges connect vertices of different types, we find that the critical parameter decreases. The size of the largest component in the supercritical regime can be both increasing and decreasing as the connections change, depending on the combination of types. For the preferential attachment model, we analyze the degree distributions of the two types and derive explicit expressions for the degree exponents. The exponents are confirmed by simulations that also illustrate other properties of the degree structure.
We analyze random networks that change over time. First we analyze a dynamic Erdos-Renyi model, whose edges change over time. We describe its stationary distribution, its convergence thereto, and the SI contact process on the network, which has relevance for connectivity and the spread of infections. Second, we analyze the effect of node turnover, when nodes enter and leave the network, which has relevance for network models incorporating births, deaths, aging, and other demographic factors.
Non-Markovian processes are widespread in natural and human-made systems, yet explicit model- ling and analysis of such systems is underdeveloped. We consider a non-Markovian dynamic network with random link activation and deletion (RLAD) and heavy tailed Mittag-Leffler distribution for the inter-event times. We derive an analytically and computationally tractable system of Kolmogorov- like forward equations utilising the Caputo derivative for the probability of having a given number of active links in the network and solve them. Simulations for the RLAD are also studied for power-law inter-event times and we show excellent agreement with the Mittag-Leffler model. This agreement holds even when the RLAD network dynamics is coupled with the susceptible-infected-susceptible (SIS) spreading dynamics. Thus, the analytically solvable Mittag-Leffler model provides an excel- lent approximation to the case when the network dynamics is characterised by power-law distributed inter-event times. We further discuss possible generalizations of our result.
The design of an efficient curing policy, able to stem an epidemic process at an affordable cost, has to account for the structure of the population contact network supporting the contagious process. Thus, we tackle the problem of allocating recovery resources among the population, at the lowest cost possible to prevent the epidemic from persisting indefinitely in the network. Specifically, we analyze a susceptible-infected-susceptible epidemic process spreading over a weighted graph, by means of a first-order mean-field approximation. First, we describe the influence of the contact network on the dynamics of the epidemics among a heterogeneous population, that is possibly divided into communities. For the case of a community network, our investigation relies on the graph-theoretical notion of equitable partition; we show that the epidemic threshold, a key measure of the network robustness against epidemic spreading, can be determined using a lower-dimensional dynamical system. Exploiting the computation of the epidemic threshold, we determine a cost-optimal curing policy by solving a convex minimization problem, which possesses a reduced dimension in the case of a community network. Lastly, we consider a two-level optimal curing problem, for which an algorithm is designed with a polynomial time complexity in the network size.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
