Modelling Complex Systems Video 4: A simple example in a complex way.

Slides:



Advertisements
Similar presentations
Generating Random Spanning Trees Sourav Chatterji Sumit Gulwani EECS Department University of California, Berkeley.
Advertisements

Introduction to Monte Carlo Markov chain (MCMC) methods
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Signals and Systems March 25, Summary thus far: software engineering Focused on abstraction and modularity in software engineering. Topics: procedures,
Lecture 6  Calculating P n – how do we raise a matrix to the n th power?  Ergodicity in Markov Chains.  When does a chain have equilibrium probabilities?
6-1 Introduction To Empirical Models 6-1 Introduction To Empirical Models.
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
Hidden Markov Models Ellen Walker Bioinformatics Hiram College, 2008.
Statistical NLP: Lecture 11
Ch-9: Markov Models Prepared by Qaiser Abbas ( )
Entropy Rates of a Stochastic Process
Hidden Markov Models Theory By Johan Walters (SR 2003)
Statistical NLP: Hidden Markov Models Updated 8/12/2005.
Lecture 15 Hidden Markov Models Dr. Jianjun Hu mleg.cse.sc.edu/edu/csce833 CSCE833 Machine Learning University of South Carolina Department of Computer.
COMPUTER MODELS IN BIOLOGY Bernie Roitberg and Greg Baker.
Random-Variate Generation. Need for Random-Variates We, usually, model uncertainty and unpredictability with statistical distributions Thereby, in order.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Fitting models to data. Step 5) Express the relationships mathematically in equations Step 6)Get values of parameters Determine what type of model you.
Thermo & Stat Mech - Spring 2006 Class 27 1 Thermodynamics and Statistical Mechanics Random Walk.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Monte Carlo Methods in Partial Differential Equations.
Lecture 7  Poisson Processes (a reminder)  Some simple facts about Poisson processes  The Birth/Death Processes in General  Differential-Difference.
Entropy Rate of a Markov Chain
Gaussian Mixture Model and the EM algorithm in Speech Recognition
Lecture 8. How to Form Recursive relations 1. Recap Asymptotic analysis helps to highlight the order of growth of functions to compare algorithms Common.
Introduction to MCMC and BUGS. Computational problems More parameters -> even more parameter combinations Exact computation and grid approximation become.
Fundamentals of Hidden Markov Model Mehmet Yunus Dönmez.
Lecture 4: Metabolism Reaction system as ordinary differential equations Reaction system as stochastic process.
Slides prepared by Rose Williams, Binghamton University ICS201 Lecture 19 : Recursion King Fahd University of Petroleum & Minerals College of Computer.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Learning Lateral Connections between Hidden Units Geoffrey Hinton University of Toronto in collaboration with Kejie Bao University of Toronto.
Monte Carlo Methods Versatile methods for analyzing the behavior of some activity, plan or process that involves uncertainty.
Workshop on Stochastic Differential Equations and Statistical Inference for Markov Processes Day 3: Numerical Methods for Stochastic Differential.
1 Elements of Queuing Theory The queuing model –Core components; –Notation; –Parameters and performance measures –Characteristics; Markov Process –Discrete-time.
Simulated Annealing.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Trust Propagation using Cellular Automata for UbiComp 28 th May 2004 —————— Dr. David Llewellyn-Jones, Prof. Madjid Merabti, Dr. Qi Shi, Dr. Bob Askwith.
Statistics and the Verification Validation & Testing of Adaptive Systems Roman D. Fresnedo M&CT, Phantom Works The Boeing Company.
Lecture 2 Basics of probability in statistical simulation and stochastic programming Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius,
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: ML and Simple Regression Bias of the ML Estimate Variance of the ML Estimate.
Mathematical Modeling of Signal Transduction Pathways Biplab Bose IIT Guwahati.
Graph Theory Techniques in Model-Based Testing
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Reestimation Equations Continuous Distributions.
Chapter 61 Continuous Time Markov Chains Birth and Death Processes,Transition Probability Function, Kolmogorov Equations, Limiting Probabilities, Uniformization.
Mathe III Lecture 5 Mathe III Lecture 5 Mathe III Lecture 5 Mathe III Lecture 5.
ECE 466/658: Performance Evaluation and Simulation Introduction Instructor: Christos Panayiotou.
PGM 2003/04 Tirgul 2 Hidden Markov Models. Introduction Hidden Markov Models (HMM) are one of the most common form of probabilistic graphical models,
Lecture 13: Linkage Analysis VI Date: 10/08/02  Complex models  Pedigrees  Elston-Stewart Algorithm  Lander-Green Algorithm.
Theory of Computations III CS-6800 |SPRING
CS433 Modeling and Simulation Lecture 07 – Part 01 Continuous Markov Chains Dr. Anis Koubâa 14 Dec 2008 Al-Imam.
Hidden Markovian Model. Some Definitions Finite automation is defined by a set of states, and a set of transitions between states that are taken based.
Multi-state System (MSS) Basic Concepts MSS is able to perform its task with partial performance “all or nothing” type of failure criterion cannot be.
The Markov Chain Monte Carlo Method Isabelle Stanton May 8, 2008 Theory Lunch.
Sampling and estimation Petter Mostad
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
Regression Analysis1. 2 INTRODUCTION TO EMPIRICAL MODELS LEAST SQUARES ESTIMATION OF THE PARAMETERS PROPERTIES OF THE LEAST SQUARES ESTIMATORS AND ESTIMATION.
By: Jesse Ehlert Dustin Wells Li Zhang Iterative Aggregation/Disaggregation(IAD)
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Reestimation Equations Continuous Distributions.
ECE 8443 – Pattern Recognition Objectives: Reestimation Equations Continuous Distributions Gaussian Mixture Models EM Derivation of Reestimation Resources:
EKT 441 MICROWAVE COMMUNICATIONS CHAPTER 3: MICROWAVE NETWORK ANALYSIS (PART 1)
Modeling CO 2 in the Atmosphere. Perhaps one of the most important graphs in history! Date C0 2 (ppm)
Cognitive Computer Vision 3R400 Kingsley Sage Room 5C16, Pevensey III
MCMC Output & Metropolis-Hastings Algorithm Part I
Heuristic Optimization Methods
Statistics 1: Elementary Statistics
Hidden Markov Models Part 2: Algorithms
Probability & Statistics Probability Theory Mathematical Probability Models Event Relationships Distributions of Random Variables Continuous Random.
Presentation transcript:

Modelling Complex Systems Video 4: A simple example in a complex way

Traditional models Probability theory and distributions. Ordinary differential equation models. Difference equations. Partial differential equation models. Stochastic differential equations. Partial differential equations. Markov chain models Statistical mechanics models.

Using traditional models Usually a whole course or number of courses will be dedicated to looking at each technique. Each types of models are also useful in modelling complex systems. But we do not take any particular traditional model as our starting point. Instead we switch backwards and forwards between different approaches.

‘Complex systems’ models Cellular automata Agent-based models Self-propelled particles All are computer simulations.

`Complex systems’ models The basic approach is to write down an algorithm which describes how our complex system works and use this algorithm to better understand the system. This algorithm becomes a computer simulation which we run to see how the system behaves. But the algorithm can also be related to more 'traditional' mathematical models in order that we can better analyse the system.

A very simple (not complex) example Lets assume we want to model two connected boxes in which ’particles’ can move On each time step we choose one particle at random at move it to the other box. What is the equilibrium distribution of particles between boxes? How long does it take to reach this equilibrium?

Simulation Code %Number of particles N=50; %Simulation of Ehrenfest model %x is number in box x x(1)=round(rand); for t=1:T-1 if rand<x(t)/N %Leave box x x(t+1)=x(t)-1; else %Enter box x x(t+1)=x(t)+1; end

Simulation Output: 1 run N=50

Simulation Output: 5 runs N=50

Mean-field approximation

Importance of multiple runs R=100; for j=1:R %Initial conditions MAIN CODE HERE %Store final value xr(j)=x(end); end figure(2) hist(xr,[0:1:50]) ylabel('Frequency Count') xlabel('Number of Particles')

Simulation Output: 100 runs N=50

Equilibrium Distribution: 100 runs

Ehrenfest model

Complex Systems Approach Express a model as an ‘algorithm’ Simulate it lots of times. Look at equilibrium distribution. See if we can use traditional mathematics to approximate it. Compare approximation and simulation. Systematically investigate the effect of changing a parameter (next lecture).

Code The code to generate the figures on the previous slides can be found on studentportalen. Ehrenfest.m