اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDynamics of epidemic spreading on connected graphs
119
0
0.0
(
0
)
تأليف
Christophe Besse
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by heat equations on the edges supplemented with Robin like boundary conditions at the vertices modeling exchanges between incident edges and the associated vertex. We describe the main properties of the system, and also derive the final total population of infected individuals. We present a semi-implicit in time numerical scheme based on finite differences in space which preserves the main properties of the continuous model such as the uniqueness and positivity of solutions and the conservation of the total population. We also illustrate our results with a selection of numerical simulations for a selection of connected graphs.
قيم البحث
اقرأ أيضاً
Nonlinear quantum graphs are metric graphs equipped with a nonlinear Schr{o}dinger equation. Whereas in the last ten years they have known considerable developments on the theoretical side, their study from the numerical point of view remains in its
early stages. The goal of this paper is to present the Grafidi library, a Python library which has been developed with the numerical simulation of nonlinear Schr{o}dinger equations on graphs in mind. We will show how, with the help of the Grafidi library, one can implement the popular normalized gradient flow and nonlinear conjugate gradient flow methods to compute ground states of a nonlinear quantum graph. We will also simulate the dynamics of the nonlinear Schr{o}dinger equation with a Crank-Nicolson relaxation scheme and a Strang splitting scheme. Finally, in a series of numerical experiments on various types of graphs, we will compare the outcome of our numerical calculations for ground states with the existing theoretical results, thereby illustrating the versatility and efficiency of our implementations in the framework of the Grafidi library.
We introduce and implement a method to compute stationary states of nonlinear Schrodinger equations on metric graphs. Stationary states are obtained as local minimizers of the nonlinear Schrodinger energy at fixed mass. Our method is based on a norma
lized gradient flow for the energy (i.e. a gradient flow projected on a fixed mass sphere) adapted to the context of nonlinear quantum graphs. We first prove that, at the continuous level, the normalized gradient flow is well-posed, mass-preserving, energy diminishing and converges (at least locally) towards stationary states. We then establish the link between the continuous flow and its discretized version. We conclude by conducting a series of numerical experiments in model situations showing the good performance of the discrete flow to compute stationary states. Further experiments as well as detailed explanation of our numerical algorithm are given in a companion paper.
We consider the generalized Benjamin-Ono (gBO) equation on the real line, $ u_t + partial_x (-mathcal H u_{x} + tfrac1{m} u^m) = 0, x in mathbb R, m = 2,3,4,5$, and perform numerical study of its solutions. We first compute the ground state solution
to $-Q -mathcal H Q^prime +frac1{m} Q^m = 0$ via Petviashvilis iteration method. We then investigate the behavior of solutions in the Benjamin-Ono ($m=2$) equation for initial data with different decay rates and show decoupling of the solution into a soliton and radiation, thus, providing confirmation to the soliton resolution conjecture in that equation. In the mBO equation ($m=3$), which is $L^2$-critical, we investigate solutions close to the ground state mass, and, in particular, we observe the formation of stable blow-up above it. Finally, we focus on the $L^2$-supercritical gBO equation with $m=4,5$. In that case we investigate the global vs finite time existence of solutions, and give numerical confirmation for the dichotomy conjecture, in particular, exhibiting blow-up phenomena in the supercritical setting.
Understanding and predicting outbreaks of contagious diseases are crucial to the development of society and public health, especially for underdeveloped countries. However, challenging problems are encountered because of complex epidemic spreading dy
namics influenced by spatial structure and human dynamics (including both human mobility and human interaction intensity). We propose a systematical model to depict nationwide epidemic spreading in C^{o}te dIvoire, which integrates multiple factors, such as human mobility, human interaction intensity, and demographic features. We provide insights to aid in modeling and predicting the epidemic spreading process by data-driven simulation and theoretical analysis, which is otherwise beyond the scope of local evaluation and geometrical views. We show that the requirement that the average local basic reproductive number to be greater than unity is not necessary for outbreaks of epidemics. The observed spreading phenomenon can be roughly explained as a heterogeneous diffusion-reaction process by redefining mobility distance according to the human mobility volume between nodes, which is beyond the geometrical viewpoint. However, the heterogeneity of human dynamics still poses challenges to precise prediction.
Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based on a greedy-type metric clustering and augmentation scheme, we show how a partition of unity can be generated in an efficien
t way on graphs. We investigate how PUMs can be combined with a local graph basis function (GBF) approximation method in order to obtain low-cost global interpolation or classification schemes. From a theoretical point of view, we study necessary prerequisites for the partition of unity such that global error estimates of the PUM follow from corresponding local ones. Finally, properties of the PUM as cost-efficiency and approximation accuracy are investigated numerically.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
