Markovian susceptible-infectious- susceptible (SIS) dynamics on finite networks: endemic prevalence and invasion probability Robert Wilkinson Kieran Sharkey.

Slides:

Advertisements

Similar presentations

Discrete time Markov Chain

Advertisements

R 0 and other reproduction numbers for households models MRC Centre for Outbreak analysis and modelling, Department of Infectious Disease Epidemiology.

Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.

It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.

CmpE 104 SOFTWARE STATISTICAL TOOLS & METHODS MEASURING & ESTIMATING SOFTWARE SIZE AND RESOURCE & SCHEDULE ESTIMATING.

1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.

Spontaneous recovery in dynamic networks Advisor: H. E. Stanley Collaborators: B. Podobnik S. Havlin S. V. Buldyrev D. Kenett Antonio Majdandzic Boston.

Discrete Time Markov Chains

Introduction of Probabilistic Reasoning and Bayesian Networks

10 Further Time Series OLS Issues Chapter 10 covered OLS properties for finite (small) sample time series data -If our Chapter 10 assumptions fail, we.

Corporate Banking and Investment Mathematical issues with volatility modelling Marek Musiela BNP Paribas 25th May 2005.

Probability of a Major Outbreak for Heterogeneous Populations Math. Biol. Group Meeting 26 April 2005 Joanne Turner and Yanni Xiao.

RD processes on heterogeneous metapopulations: Continuous-time formulation and simulations wANPE08 – December 15-17, Udine Joan Saldaña Universitat de.

On the Spread of Viruses on the Internet Noam Berger Joint work with C. Borgs, J.T. Chayes and A. Saberi.

Entropy Rates of a Stochastic Process

Pair-level approximations to the spatio-temporal dynamics of epidemics on asymmetric contact networks Roger G Bowers Kieran Sharkey The University of Liverpool.

Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.

1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.

Output Analysis and Experimentation for Systems Simulation.

Chapter 5: Probability Concepts

Chapter 4: Stochastic Processes Poisson Processes and Markov Chains

DIMACS 10/9/06 Zhilan Feng Collaborators and references Zhilan Feng, David Smith, F. Ellis McKenzie, Simon Levin Mathematical Biosciences (2004) Zhilan.

1 The epidemic in a closed population Department of Mathematical Sciences The University of Liverpool U.K. Roger G. Bowers.

Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.

Review of Probability and Random Processes

Chapter 2 Chapter The sample space of an experiment, denoted S , is the set of all possible outcomes of that experiment. An event is any collection.

Sampling Theory Determining the distribution of Sample statistics.

STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.

CS6800 Advanced Theory of Computation Fall 2012 Vinay B Gavirangaswamy

Bayes Net Perspectives on Causation and Causal Inference

Online Social Networks and Media Epidemics and Influence.

Entropy Rate of a Markov Chain

MAKING COMPLEX DEClSlONS

Mathematical Processes GLE  I can recognize which symbol correlates with the correct term.  I can recall the correct definition for each mathematical.

Sampling Theory Determining the distribution of Sample statistics.

Traceroute-like exploration of unknown networks: a statistical analysis A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, France) L.

Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL ACCESS Distinguished Lecture Series, Stockholm, May 28,

Are global epidemics predictable ? V. Colizza School of Informatics, Indiana University, USA M. Barthélemy School of Informatics, Indiana University, USA.

Fluid Limits for Gossip Processes Vahideh Manshadi and Ramesh Johari DARPA ITMANET Meeting March 5-6, 2009 TexPoint fonts used in EMF. Read the TexPoint.

V5 Epidemics on networks

Epidemic dynamics on networks Kieran Sharkey University of Liverpool NeST workshop, June 2014.

Chapter 6 Introduction to Inferential Statistics: Sampling and the Sampling Distribution.

Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.

E PIDEMIC SPREADING Speaker: Ao Weng Chon Advisor: Kwang-Cheng Chen 1.

Modeling frameworks Today, compare:Deterministic Compartmental Models (DCM) Stochastic Pairwise Models (SPM) for (I, SI, SIR, SIS) Rest of the week: Focus.

Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.

Epidemic (Compartment) Models. Epidemic without Removal SI Process Only Transition: Infection Transmission SIS Process Two Transitions: Infection and.

Influenza epidemic spread simulation for Poland – A large scale, individual based model study.

Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.

Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,

Evaluating Persistence Times in Populations Subject to Catastrophes Ben Cairns and Phil Pollett Department of Mathematics.

Basic Principles (continuation) 1. A Quantitative Measure of Information As we already have realized, when a statistical experiment has n eqiuprobable.

Designing Games for Distributed Optimization Na Li and Jason R. Marden IEEE Journal of Selected Topics in Signal Processing, Vol. 7, No. 2, pp ,

Lab for Remote Sensing Hydrology and Spatial Modeling Dept of Bioenvironmental Systems Engineering National Taiwan University 1/45 GEOSTATISTICS INTRODUCTION.

Measurements and Their Analysis. Introduction Note that in this chapter, we are talking about multiple measurements of the same quantity Numerical analysis.

Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.

1 Review of Probability and Random Processes. 2 Importance of Random Processes Random variables and processes talk about quantities and signals which.

Sampling Theory Determining the distribution of Sample statistics.

1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.

Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.

Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July

Basic ideas 1.2 Sample space Event. Definition1.1 The of a random experiment The set of all possible outcomes of a random experiment is called the of.

Review of Probability Theory

Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama

Theory of Capital Markets

Paper Code : BCA-27 Paper Title : Discrete Mathematics.

Lebesgue measure: Lebesgue measure m0 is a measure on i.e., 1. 2.

Markov Random Fields Presented by: Vladan Radosavljevic.

Presentation transcript:

Markovian susceptible-infectious- susceptible (SIS) dynamics on finite networks: endemic prevalence and invasion probability Robert Wilkinson Kieran Sharkey University of Liverpool

Outline 1 Markovian SIS dynamics on networks (infection with no acquired immunity) 2 Invasion probability and endemic prevalence 3 Outline of our main results 4 Theory 5 The prevalence-invasion relationship 6 Numerical Illustration 7 Conclusion

Markovian SIS dynamics on networks Susceptible individualInfected individual Contact network the rate of infecting contacts from j to i 2 types of event for individual i Infection Recovery the rate at which i recovers when infectious population size

‘Invasion probability’ and ‘endemic prevalence’ Context 1: mean-field theory (large, evenly-mixed homogeneous population) Fraction of population infected in endemic situation (stationary solution) Probability of invasion from single initial infected (from theory of birth/death processes)

Issues: 1 Finite state space – extinction certain – no stationary distribution for the endemic situation. 2 Meaning of invasion is obscure. Context 2: finite heterogeneous networks Objectives: 1) To define invasion probability and endemic prevalence. 2) To determine the relationship between the quantities. First: Numerically investigate Invasion and Prevalence on a complex network: The network of contacts between sites in the British Poultry Flock ‘Invasion probability’ and ‘endemic prevalence’

Approx. 12,700 sites

Weighted Structured Approx. 12,700 sites

Look for dichotomised behaviour Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 Invasion probability Average over apparently ‘stable’ behaviour Endemic prevalence ‘Invasion probability’ and ‘endemic prevalence’

Look for dichotomised behaviour Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 Invasion probability For an individual node, prevalence is the probability that it is infectious in this “endemic state”. Average over apparently ‘stable’ behaviour Endemic prevalence ‘Invasion probability’ and ‘endemic prevalence’

Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 Numerical illustration for a single individual in this complex network: Let T→kT for various k ‘Invasion probability’ and ‘endemic prevalence’

Outline of our main theoretical results: We can formulate precise mathematical quantifiers for both invasion probability and endemic prevalence, and demonstrate an exact relationship between them, by making use of: 1.‘Graphical representation’ of the dynamic process and the property of ‘duality’ (Harris 1976, Holley & Liggett 1975). 2.The quasi-stationary distribution (Daroch & Seneta 1967). Almost all work relating to the graphical representation and duality considers the contact network as an infinite square lattice (undirected, non- weighted). But, it is simple to apply these ideas to weighted and directed graphs. Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 ‘Invasion probability’ and ‘endemic prevalence’

Graphical representation i j k 0 t Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028

Graphical representation 0 t TT 0 t Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028

Duality Importantly, the property of duality for Markovian SIS dynamics on networks implies that: = where A is any set of individuals. Also: = Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028

The quasi-stationary distribution (endemic situation) If the network is strongly connected such that the infection can travel, via some route, from any individual to any other individual then: 1 the transient states form a single commuting class 2 Conditional on non-absorption, the system will approach a unique quasi-stationary distribution (QSD) as t approaches infinity (assuming the system is initiated in a transient state) Therefore, for a subset (of individuals) A in a strongly connected network T, we define: = Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028

The quasi-stationary distribution (endemic situation) Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028

The quasi-stationary distribution (endemic situation) Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 !!!

Quasi-invasion (invasion probability) For a subset (of individuals) A in a strongly connected network T, we define: = The definition works because: 1) given non-extinction, the system converges to the unique QSD, irrespective of the initial transient state. 2) the all-infected state maximises the expected time to extinction (easily proved via graphical representation). Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028

More generally, for any model of infection dynamics where there is a unique QSD that is independent of the initial transient state, we define: = Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 Quasi-invasion (invasion probability)

The prevalence-invasion relationship Our main result can be stated as follows: = For any subset A of a strongly connected network T, conditional on Markovian SIS dynamics. This follows from the definitions and duality. Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028

= Summing i over all N nodes and dividing by N: = Probability of invasion when seeded from a single individual chosen uniformly at random Fraction of sites infected in the QSD (endemic situation) Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 The prevalence-invasion relationship For a single individual i

i = Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 Numerical illustration – small square lattice

i = Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 Numerical illustration – small square lattice

Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028

Conclusions Prevalence data can be used to inform invasion risk. The prevalence-invasion relationship lends support to the targeting of high risk individuals, in these kinds of (undirected) systems, as an effective strategy for the mitigation and control of emerging epidemics. We believe that it will now be possible to define invasion probability in a consistent way across a wide range of stochastic models, and that the prevalence-invasion relationship for more complicated models (extra compartments, non-Markovian) should be investigated. Wilkinson RR, Sharkey KJ (2013) PLoS ONE 8(7): e69028 = The End