Interacting Viruses in Networks: Can Both Survive? Authors: Alex Beutel, B. Aditya Prakash, Roni Rosenfeld, and Christos Faloutsos Presented by: Zachary.

Slides:



Advertisements
Similar presentations
Diffusion and Cascading Behavior in Random Networks Marc Lelarge (INRIA-ENS) Columbia University Joint CS/EE Networking Seminar June 2, 2011.
Advertisements

Modeling of Complex Social Systems MATH 800 Fall 2011.
TOPDRIM: Update WP2 March 2013 Rick Quax, Peter M.A. Sloot.
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
R 0 and other reproduction numbers for households models MRC Centre for Outbreak analysis and modelling, Department of Infectious Disease Epidemiology.
Differential Equations
On the Vulnerability of Large Graphs
Influence propagation in large graphs - theorems and algorithms B. Aditya Prakash Christos Faloutsos
Dynamical Processes on Large Networks B. Aditya Prakash Carnegie Mellon University MMS, SIAM AN, Minneapolis, July 10,
Epidemics Modeling them with math. History of epidemics Plague in 1300’s killed in excess of 25 million people Plague in London in 1665 killed 75,000.
Diffusion and Cascading Behavior in Random Networks Marc Lelarge (INRIA-ENS) WIDS MIT, May 31, 2011.
Interacting Viruses: Can Both Survive? Alex Beutel, B. Aditya Prakash, Roni Rosenfeld, Christos Faloutsos Carnegie Mellon University, USA KDD 2012, Beijing.
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.
© 2012 IBM Corporation IBM Research Gelling, and Melting, Large Graphs by Edge Manipulation Joint Work by Hanghang Tong (IBM) B. Aditya Prakash (Virginia.
Ch 9.4: Competing Species In this section we explore the application of phase plane analysis to some problems in population dynamics. These problems involve.
MobiMedia 2007, Nafpaktos, Greece International Mobile Multimedia Communications Conference 2007 An Epidemiological Model for Semantics Dissemination Christos.
1 Predator-Prey Oscillations in Space (again) Sandi Merchant D-dudes meeting November 21, 2005.
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.
Population dynamics of infectious diseases Arjan Stegeman.
Viral Video Spread Over Human Space Maruf Hasan Zaber, Mehrab Bin Morshed, Md Habibullah Bin Ismail Department of Computer Science and Engineering (CSE),
Mathematical model of inter- specific competition for two protozoan species Hassan Khassehkhan, Ross Macdonald and David Drolet Supervisor: Rebecca Tyson.
CMU SCS Mining Billion-node Graphs Christos Faloutsos CMU.
Social Networks and Graph Mining Christos Faloutsos CMU - MLD.
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Kurtis Cahill James Badal.  Introduction  Model a Maze as a Markov Chain  Assumptions  First Approach and Example  Second Approach and Example 
Virus Propagation Modeling Chenxi Wang, Christos Faloutsos Yang Wang, Deepayan Chakrabarti Carnegie Mellon University Center for Computer.
The Final Bugbox Model Let L t be the number of larvae at time t. Let P t be the number of pupae at time t. Let A t be the number of adults at time t.
Jun, 2002 MTBI Cornell University TB Cluster Models, Time Scales and Relations to HIV Carlos Castillo-Chavez Department of Biological Statistics and Computational.
How does mass immunisation affect disease incidence? Niels G Becker (with help from Peter Caley ) National Centre for Epidemiology and Population Health.
Models of Influence in Online Social Networks
Epidemic spreading in complex networks: from populations to the Internet Maziar Nekovee, BT Research Y. Moreno, A. Paceco (U. Zaragoza) A. Vespignani (LPT-
Online Social Networks and Media Epidemics and Influence.
Spreading of Epidemic Based on Human and Animal Mobility Pattern
Influence propagation in large graphs - theorems and algorithms B. Aditya Prakash Christos Faloutsos
CMU SCS Large Graph Mining Christos Faloutsos CMU.
Carnegie Mellon School of Computer Science Modeling Website Popularity Competition in the Attention-Activity Marketplace Bruno Ribeiro Christos Faloutsos.
V5 Epidemics on networks
CODE RED WORM PROPAGATION MODELING AND ANALYSIS Cliff Changchun Zou, Weibo Gong, Don Towsley.
Directed-Graph Epidemiological Models of Computer Viruses Presented by: (Kelvin) Weiguo Jin “… (we) adapt the techniques of mathematical epidemiology to.
Sanja Teodorović University of Novi Sad Faculty of Science.
1 Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
Markovian susceptible-infectious- susceptible (SIS) dynamics on finite networks: endemic prevalence and invasion probability Robert Wilkinson Kieran Sharkey.
Winner-takes-all: Competing Viruses or Ideas on fair-play Networks B. Aditya Prakash, Alex Beutel, Roni Rosenfeld, Christos Faloutsos Carnegie Mellon University,
E PIDEMIC SPREADING Speaker: Ao Weng Chon Advisor: Kwang-Cheng Chen 1.
Two-species competition The Lotka-Volterra Model Working with differential equations to predict population dynamics.
1 Epidemic Data Survivability in UWSNs
Epidemic (Compartment) Models. Epidemic without Removal SI Process Only Transition: Infection Transmission SIS Process Two Transitions: Infection and.
Influence propagation in large graphs - theorems and algorithms B. Aditya Prakash Christos Faloutsos
ECML-PKDD 2010, Barcelona, Spain B. Aditya Prakash*, Hanghang Tong* ^, Nicholas Valler+, Michalis Faloutsos+, Christos Faloutsos* * Carnegie Mellon University,
Propagation on Large Networks B. Aditya Prakash Christos Faloutsos Carnegie Mellon University.
L – Modelling and Simulating Social Systems with MATLAB © ETH Zürich | Lesson 3 – Dynamical Systems Anders Johansson and Wenjian.
Propagation on Large Networks B. Aditya Prakash Christos Faloutsos Carnegie Mellon University.
System Dynamics Modeling of Community Sustainability in NetLogo Thomas Bettge TJHSST Computer Systems Lab Senior Research Project
Transport in weighted networks: optimal path and superhighways Collaborators: Z. Wu, Y. Chen, E. Lopez, S. Carmi, L.A. Braunstein, S. Buldyrev, H. E. Stanley.
Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.
Predicting the Future To Predict the Future, “all we have to have is a knowledge of how things are and an understanding of the rules that govern the changes.
EBM: Control Freaks Model Zero: Two interacting species and a regulator who is informationally challenged.
B. Aditya Prakash Naren Ramakrishnan
Boyce/DiPrima 9th ed, Ch 9.4: Competing Species Elementary Differential Equations and Boundary Value Problems, 9th edition, by William E. Boyce and.
SEIV Epidemic Model & Resource Allocation
Predicting the Future To Predict the Future, “all we have to have is a knowledge of how things are and an understanding of the rules that govern the changes.
Chemical Reaction Networks :
Predicting the Future To Predict the Future, “all we have to have is a knowledge of how things are and an understanding of the rules that govern the changes.
Large Graph Mining: Power Tools and a Practitioner’s guide
A Novel 2-Hop Flow Approach
Evolution of Replicator Systems Bratus A. S. 1,2 , Yakushkina T
Presentation transcript:

Interacting Viruses in Networks: Can Both Survive? Authors: Alex Beutel, B. Aditya Prakash, Roni Rosenfeld, and Christos Faloutsos Presented by: Zachary Stanfield March 3, 2015

Motivation Central Question: Given two partially competing products/entities, is it possible that they both survive? Current Theory: The Competitive Exclusion Principle - when two species compete under constant conditions, the more fit one will drive the less fit one to extinction. No complete theory for two competing species under partial immunity that allows/predicts coexistence.

Background and Related Work Single virus models: SIS, SIR, SIRS (S = susceptible, I = infected) Notable limitation: Most studies assume that the network is a clique (homogeneous model) Focus placed on finding the “epidemic threshold”. Under what conditions will a virus become extinct? Threshold recently discovered as the leading eigenvalue of the graph adjacency matrix for a single virus model. Two virus-models of SIS with full mutual immunity recently studied on arbitrary graphs -> Winner takes all

Goals Provide analytical proof of a competitive epidemic threshold, ϵ critical Define a novel model Solve the closed-form steady-state behavior under the SIS (flu-like) setting Show that the model applies to real world instances

Model Formulation State Diagram for a single node in the graph for partial competition

Mathematical Analysis At steady state, the derivatives are equal to zero, and three equilibrium points are found. And possibly one more where

Finding critical For κ 1, κ 2 > 0, where κ 1 = ((I 1 + I 1,2 )/N) = fraction of nodes infected with virus 1, they prove that there exist valid equilibrium points κ 1 * and κ 2 * for which the population infected by each virus is non-zero Given a fully connected graph, their SI 1|2 S model, and virus strengths σ 1 ≥σ 2 ≥1, the above equilibrium points exist if ϵ > ϵ critical

Experiments *(6-4)/(4*(6-1)) = 0.1

Case Studies Data from Google-Insights. Two examples of partial immunity – people can use both, but the use of one lessens the use of the other. Introduce Hulu and Chrome while Blockbuster and Firefox begin in steady state. Hulu and Chrome have higher “infection rates” δ

Conclusions This model setup is novel. Mathematical proof of the transition from winner takes all to coexistence Experiments and Case-studies agree with model prediction Impressions Logical approach to an unsolved problem Simulations accurately capture real data in many application areas Limited to fully connected graphs and parameters have to be chosen correctly to fit the data, but there is predictive power.