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

Slides:



Advertisements
Similar presentations
Stationary Probability Vector of a Higher-order Markov Chain By Zhang Shixiao Supervisors: Prof. Chi-Kwong Li and Dr. Jor-Ting Chan.
Advertisements

Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
CS433 Modeling and Simulation Lecture 06 – Part 03 Discrete Markov Chains Dr. Anis Koubâa 12 Apr 2009 Al-Imam Mohammad Ibn Saud University.
Multiscale Stochastic Simulation Algorithm with Stochastic Partial Equilibrium Assumption for Chemically Reacting Systems Linda Petzold and Yang Cao University.
Markov Chains 1.
TCOM 501: Networking Theory & Fundamentals
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Андрей Андреевич Марков. Markov Chains Graduate Seminar in Applied Statistics Presented by Matthias Theubert Never look behind you…
MEAN FIELD FOR MARKOV DECISION PROCESSES: FROM DISCRETE TO CONTINUOUS OPTIMIZATION Jean-Yves Le Boudec, Nicolas Gast, Bruno Gaujal July 26,
Reliable System Design 2011 by: Amir M. Rahmani
Planning under Uncertainty
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)
Outline Formulation of Filtering Problem General Conditions for Filtering Equation Filtering Model for Reflecting Diffusions Wong-Zakai Approximation.
ODE and Discrete Simulation or Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL MLQA, Aachen, September
Queuing Theory For Dummies
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL July
Mean Field Methods for Computer and Communication Systems: A Tutorial Jean-Yves Le Boudec EPFL Performance 2010 Namur, November
1 Summarizing Performance Data Confidence Intervals Important Easy to Difficult Warning: some mathematical content.
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/16 J. Cho, J.-Y. Le Boudec, and Y. Jiang, “Decoupling Assumption in ” On the Validity of the Decoupling Assumption in JEONG-WOO CHO Norwegian.
1 ENS, June 21, 2007 Jean-Yves Le Boudec, EPFL joint work with David McDonald, U. of Ottawa and Jochen Mundinger, EPFL …or an Art ? Is Mean Field a Technology…
1 A Generic Mean Field Convergence Result for Systems of Interacting Objects From Micro to Macro Jean-Yves Le Boudec, EPFL Joint work with David McDonald,
1 A Class Of Mean Field Interaction Models for Computer and Communication Systems Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with Michel Benaïm.
Nonlinear and Non-Gaussian Estimation with A Focus on Particle Filters Prasanth Jeevan Mary Knox May 12, 2006.
Particle filters (continued…). Recall Particle filters –Track state sequence x i given the measurements ( y 0, y 1, …., y i ) –Non-linear dynamics –Non-linear.
1 Random Trip Stationarity, Perfect Simulation and Long Range Dependence Jean-Yves Le Boudec (EPFL) joint work with Milan Vojnovic (Microsoft Research.
1 Hybrid Agent-Based Modeling: Architectures,Analyses and Applications (Stage One) Li, Hailin.
1 Mean Field Interaction Models for Computer and Communication Systems and the Decoupling Assumption Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with.
Simulation Models as a Research Method Professor Alexander Settles.
1 A Generic Mean Field Convergence Result for Systems of Interacting Objects From Micro to Macro Jean-Yves Le Boudec, EPFL Joint work with David McDonald,
1/15 Basic Theorems on the Backoff Process in JEONG-WOO CHO Q2S, Norwegian University of Science and Technology (NTNU), Norway Joint work with YUMING.
1 A Class Of Mean Field Interaction Models for Computer and Communication Systems Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with Michel Benaïm.
1 Modeling and Simulating Networking Systems with Markov Processes Tools and Methods of Wide Applicability ? Jean-Yves Le Boudec
CS6800 Advanced Theory of Computation Fall 2012 Vinay B Gavirangaswamy
Lecture 11 – Stochastic Processes
1 Summarizing Performance Data Confidence Intervals Important Easy to Difficult Warning: some mathematical content.
6. Markov Chain. State Space The state space is the set of values a random variable X can take. E.g.: integer 1 to 6 in a dice experiment, or the locations.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL ACCESS Distinguished Lecture Series, Stockholm, May 28,
Performance Evaluation Lecture 2: Epidemics Giovanni Neglia INRIA – EPI Maestro 9 January 2014.
ECES 741: Stochastic Decision & Control Processes – Chapter 1: The DP Algorithm 1 Chapter 1: The DP Algorithm To do:  sequential decision-making  state.
Performance Evaluation Lecture 4: Epidemics Giovanni Neglia INRIA – EPI Maestro 12 January 2013.
1 ECE-517 Reinforcement Learning in Artificial Intelligence Lecture 7: Finite Horizon MDPs, Dynamic Programming Dr. Itamar Arel College of Engineering.
Workshop on Stochastic Differential Equations and Statistical Inference for Markov Processes Day 3: Numerical Methods for Stochastic Differential.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Simulated Annealing.
Queuing Networks Jean-Yves Le Boudec 1. Contents 1.The Class of Multi-Class Product Form Networks 2.The Elements of a Product-Form Network 3.The Product-Form.
On the Age of Pseudonyms in Mobile Ad Hoc Networks Julien Freudiger, Mohammad Hossein Manshaei, Jean-Yves Le Boudec and Jean-Pierre Hubaux Infocom 2010.
Chapter 61 Continuous Time Markov Chains Birth and Death Processes,Transition Probability Function, Kolmogorov Equations, Limiting Probabilities, Uniformization.
ECE-7000: Nonlinear Dynamical Systems Overfitting and model costs Overfitting  The more free parameters a model has, the better it can be adapted.
1 Summarizing Performance Data Confidence Intervals Important Easy to Difficult Warning: some mathematical content.
BMTRY 763. Space-time (ST) Modeling (BDM13, ch 12) Some notation Assume counts within fixed spatial and temporal periods: map evolutions Both space and.
An Introduction to Markov Chain Monte Carlo Teg Grenager July 1, 2004.
MA354 An Introduction to Math Models (more or less corresponding to 1.0 in your book)
De novo discovery of mutated driver pathways in cancer Discussion leader: Matthew Bernstein Scribe: Kun-Chieh Wang Computational Network Biology BMI 826/Computer.
The Markov Chain Monte Carlo Method Isabelle Stanton May 8, 2008 Theory Lunch.
Discrete Time Markov Chains
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
CS774. Markov Random Field : Theory and Application Lecture 15 Kyomin Jung KAIST Oct
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
Smart Sleeping Policies for Wireless Sensor Networks Venu Veeravalli ECE Department & Coordinated Science Lab University of Illinois at Urbana-Champaign.
11. Markov Chains (MCs) 2 Courtesy of J. Bard, L. Page, and J. Heyl.
Discrete-time Markov chain (DTMC) State space distribution
Performance Evaluation
Review of Probability Theory
Reinforcement Learning Dynamics in Social Dilemmas
Advanced Statistical Computing Fall 2016
Monte Carlo methods 10/20/11.
Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with Michel Benaïm
of the IEEE Distributed Coordination Function
Lecture 11 – Stochastic Processes
Presentation transcript:

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

Contents 1.Mean Field Interaction Model 2.Convergence to ODE 3.Finite Horizon: Fast Simulation and Decoupling assumption 4.Infinite Horizon: Fixed Point Method and Decoupling assumption 2

MEAN FIELD INTERACTION MODEL 1 3

Mean Field A model introduced in Physics interaction between particles is via distribution of states of all particle An approximation method for a large collection of particles assumes independence in the master equation Why do we care in information and communication systems ? Model interaction of many objects: Distributed systems, communication protocols, game theory, self- organized systems 4

A Few Examples Where Applied 5 Never again ! E.L.

Mean Field Interaction Model Time is discrete (this talk) or continuous N objects, N large Object n has state X n (t) (X N 1 (t), …, X N N (t)) is Markov Objects are observable only through their state “Occupancy measure” M N (t) = distribution of object states at time t 6

7 Example: 2-Step Malware Mobile nodes are either `S’ Susceptible `D’ Dormant `A’ Active Time is discrete Transitions affect 1 or 2 nodes State space is finite = {`S’, `A’,`D’} Occupancy measure is M(t) = (S(t), D(t), A(t)) with S(t)+ D(t) + A(t) =1 S(t) = proportion of nodes in state `S’ [Benaïm and Le Boudec(2008)] 1.Recovery D -> S 2.Mutual upgrade D + D -> A + A 3.Infection by active D + A -> A + A 4.Recovery A -> S 5.Recruitment by Dormant S + D -> D + D Direct infection S -> D 6.Direct infection S -> A

8 2-Step Malware – Full Specification 1.Recovery D -> S 2.Mutual upgrade D + D -> A + A 3.Infection by active D + A -> A + A 4.Recovery A -> S 5.Recruitment by Dormant S + D -> D + D Direct infection S -> D 6.Direct infection S -> A

A(t) Proportion of nodes In state i=2 9 Simulation Runs, N=1000 nodes Node 1 Node 2 Node 3 D(t) Proportion of nodes In state i=1 State = D State = A State = S

10 Sample Runs with N = 1000

The Importance of Being Spatial Mobile node state = (c, t) c = 1 … 16 (position) t ∊ R + (age of gossip) Time is continuous Occupancy measure is F c (z,t) = proportion of nodes that at location c and have age ≤ z [Age of Gossip, Chaintreau et al.(2009)] 11 Qqplots simulation vs mean field no class 16 classes

12 What can we do with a Mean Field Interaction Model ? Large N asymptotics, Finite Horizon fluid limit of occupancy measure (ODE) decoupling assumption (fast simulation) Issues When valid How to formulate the fluid limit Large t asymptotic Stationary approximation of occupancy measure Decoupling assumption Issues When valid

CONVERGENCE TO ODE E. L.

To Obtain a Mean Field Limit we Must Make Assumptions about the Intensity I(N) 14

15

The Mean Field Limit 16

Mean Field Limit N = + ∞ Stochastic system N =

Sufficient Conditions for Convergence 18

Example: Convergence to Mean Field 19 Mean Field Limit N = + ∞ Stochastic system N = 1000

Formulating the Mean Field Limit 20 drift = = = = ODE

Convergence to Mean Field Thus: For the finite state space case, most cases are verifiable by inspection of the model For the general state space, things may be more complex (fluid limit is not an ODE, e.g. [Chaintreau et al, 2009], [Gomez-Serrano et al, 2012]) 21 E.L.

FINITE HORIZON : FAST SIMULATION AND DECOUPLING ASSUMPTION 3. 22

The Decoupling Assumption 23

The Decoupling Assumption 24

25 The Two Interpretations of the Mean Field Limit

Fast Simulation The evolution for one object as if the other objects had a state drawn randomly and independently from the distribution m(t) Is valid over finite horizon whenever mean field convergence occurs Can be used to perform «fast simulation», i.e., simulate in detail only one or two objects, replace the rest by the mean field limit (ODE) 26

We can fast-simulate one node, and even compute its PDF at any time 27 pdf of node 1 pdf of node 2 (initially in A state) pdf of node 3

INFINITE HORIZON: FIXED POINT METHOD AND DECOUPLING ASSUMPTION 4. 28

Decoupling Assumption in Stationary Regime 29

30 Example: Analysis, Bianchi’s Formula single cell m i = proba one node is in backoff stage I  = attempt rate  = collision proba See [Benaim and Le Boudec, 2008] for this analysis Solve for Fixed Point: Bianchi’s Fixed Point Equation [Bianchi 1998] ODE for mean field limit

31 Example Where Fixed Point Method Fails

32 When the Fixed Point Method Fails, Decoupling Assumption Does not Hold R h=0.1

Example: with Heterogeneous Nodes [Cho et al, 2010] Two classes of nodes with heterogeneous parameters (restransmission probability) Fixed point equation has a unique solution, but this is not the stationary proba There is a limit cycle 33

34 Where is the Catch ? Decoupling assumption says that nodes m and n are asymptotically independent There is mean field convergence for this example But we saw that nodes may not be asymptotically independent … is there a contradiction ?

35 m i (t) m j (t) Mean Field Convergence Markov chain is ergodic ≠

36 Positive Result 1 [e.g. Benaim et al 2008] : Decoupling Assumption Holds in Stationary Regime if mean field limit ODE has a unique fixed point to which all trajectories converge Decoupling holds in stationary regime Decoupling does not hold in stationary regime

Positive Result 2: In the Reversible Case, the Fixed Point Method Always Works 37

A Correct Method in Order to Make the Decoupling Assumptions 1. Write dynamical system equations in transient regime 2. Study the stationary regime of dynamical system if converges to unique stationary point m* then make fixed point assumption else objects are coupled in stationary regime by mean field limit m(t) Hard to predict outcome of 2 (except for reversible case) 38

Stationary Behaviour of Mean Field Limit is not predicted by Structure of Markov Chain S N (for N = 200) h = 0.3 h = 0.1

Conclusion Mean field models are frequent in large scale systems Validity of approach is often simple by inspection Mean field is both ODE for fluid limit Fast simulation using decoupling assumption Decoupling assumption holds at finite horizon; may not hold in stationary regime (except for reversible case) Study the stationary regime of the ODE ! (instead of computing the stationary proba of the Markov chain) 40

41 Thank You …

References 42

43

44 2 [Gomez-Serrano et al, 2012] Gomez-Serrano J., Graham C. and Le Boudec J.-Y. The Bounded Confidence Model Of Opinion Dynamics Mathematical Models and Methods in Applied Sciences, Vol. 22, Nr. 2, pp , 2012.

45

46