اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStatistical inference for unknown parameters of stochastic SIS epidemics on complete graphs
128
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we are concerned with the stochastic susceptible-infectious-susceptible (SIS) epidemic model on the complete graph with $n$ vertices. This model has two parameters, which are the infection rate and the recovery rate. By utilizing the theory of density-dependent Markov chains, we give consistent estimations of the above two parameters as $n$ grows to infinity according to the sample path of the model in a finite time interval. Furthermore, we establish the central limit theorem (CLT) and the moderate deviation principle (MDP) of our estimations. As an application of our CLT, reject regions of hypothesis testings of two parameters are given. As an application of our MDP, confidence intervals with lengths converging to $0$ while confidence levels converging to $1$ are given as $n$ grows to infinity.
قيم البحث
اقرأ أيضاً
Stochastic epidemic models on networks are inherently high-dimensional and the resulting exact models are intractable numerically even for modest network sizes. Mean-field models provide an alternative but can only capture average quantities, thus of
fering little or no information about variability in the outcome of the exact process. In this paper we conjecture and numerically prove that it is possible to construct PDE-limits of the exact stochastic SIS epidemics on regular and ErdH{o}s-Renyi networks. To do this we first approximate the exact stochastic process at population level by a Birth-and-Death process (BD) (with a state space of $O(N)$ rather than $O(2^N)$) whose coefficients are determined numerically from Gillespie simulations of the exact epidemic on explicit networks. We numerically demonstrate that the coefficients of the resulting BD process are density-dependent, a crucial condition for the existence of a PDE limit. Extensive numerical tests for Regular and ErdH{o}s-Renyi networks show excellent agreement between the outcome of simulations and the numerical solution of the Fokker-Planck equations. Apart from a significant reduction in dimensionality, the PDE also provides the means to derive the epidemic outbreak threshold linking network and disease dynamics parameters, albeit in an implicit way. Perhaps more importantly, it enables the formulation and numerical evaluation of likelihoods for epidemic and network inference as illustrated in a worked out example.
The evoSIR model is a modification of the usual SIR process on a graph $G$ in which $S-I$ connections are broken at rate $rho$ and the $S$ connects to a randomly chosen vertex. The evoSI model is the same as evoSIR but recovery is impossible. In an u
ndergraduate project at Duke the critical value for evoSIR was computed and simulations showed that when $G$ is an ErdH os-Renyi graph with mean degree 5, the system has a discontinuous phase transition, i.e., as the infection rate $lambda$ decreases to $lambda_c$, the fraction of individuals infected during the epidemic does not converge to 0. In this paper we study evoSI dynamics on graphs generated by the configuration model. We show that there is a quantity $Delta$ determined by the first three moments of the degree distribution, so that the phase transition is discontinuous if $Delta>0$ and continuous if $Delta<0$.
In this paper, a branching process approximation for the spread of a Reed-Frost epidemic on a network with tunable clustering is derived. The approximation gives rise to expressions for the epidemic threshold and the probability of a large outbreak i
n the epidemic. It is investigated how these quantities varies with the clustering in the graph and it turns out for instance that, as the clustering increases, the epidemic threshold decreases. The network is modelled by a random intersection graph, in which individuals are independently members of a number of groups and two individuals are linked to each other if and only if they share at least one group.
Here, we consider an SIS epidemic model where the individuals are distributed on several distinct patches. We construct a stochastic model and then prove that it converges to a deterministic model as the total population size tends to infinity. Furth
ermore, we show the existence and the global stability of a unique endemic equilibrium provided that the migration rates of susceptible and infectious individuals are equal. Finally, we compare the equilibra with those of the homogeneous model, and with those of isolated patches.
A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be an avoidance coupling if the walkers never collide. Previous studies of these processes have focused almost exclusively on complete graphs, in particula
r how many walkers an avoidance coupling can include. For other graphs, apart from special cases, it has been unsettled whether even two non-colliding simple random walkers can be coupled. In this article, we construct such a coupling on (i) any $d$-regular graph avoiding a fixed subgraph depending on $d$; and (ii) any square-free graph with minimum degree at least three. A corollary of the first result is that a uniformly random regular graph on $n$ vertices admits an avoidance coupling with high probability.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
