Succession Model We talked about the facilitation, inhibition, and tolerance models, but all of these were verbal descriptions Today we are going to consider.

Slides:



Advertisements
Similar presentations
Chapter 7: Matrix Algebra 1.(7.1) Matrix Arithmetic a)Matrix-Vector Multiplication b)Matrix-Matrix Multiplication 2.(7.2) Applications 1.(7.1) Matrix Arithmetic.
Advertisements

ST3236: Stochastic Process Tutorial 3 TA: Mar Choong Hock Exercises: 4.
Christopher Dougherty EC220 - Introduction to econometrics (chapter 2) Slideshow: a Monte Carlo experiment Original citation: Dougherty, C. (2012) EC220.
Probability Distributions CSLU 2850.Lo1 Spring 2008 Cameron McInally Fordham University May contain work from the Creative Commons.
Estimating from Samples © Christine Crisp “Teach A Level Maths” Statistics 2.
Matrix Algebra Matrix algebra is a means of expressing large numbers of calculations made upon ordered sets of numbers. Often referred to as Linear Algebra.
Matrix Algebra Matrix algebra is a means of expressing large numbers of calculations made upon ordered sets of numbers. Often referred to as Linear Algebra.
Modeling and Simulation Monte carlo simulation 1 Arwa Ibrahim Ahmed Princess Nora University.
Chapter 8: Long-Term Dynamics or Equilibrium 1.(8.1) Equilibrium 2.(8.2) Eigenvectors 3.(8.3) Stability 1.(8.1) Equilibrium 2.(8.2) Eigenvectors 3.(8.3)
Markov Analysis Jørn Vatn NTNU.
Section 10.1 Basic Properties of Markov Chains
Андрей Андреевич Марков. Markov Chains Graduate Seminar in Applied Statistics Presented by Matthias Theubert Never look behind you…
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 16-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 16.
MAT 4830 Mathematical Modeling 4.4 Matrix Models of Base Substitutions II
DARPA Oasis PI Meeting Hilton Head, SC March 2002.
1. Markov Process 2. States 3. Transition Matrix 4. Stochastic Matrix 5. Distribution Matrix 6. Distribution Matrix for n 7. Interpretation of the Entries.
What is the probability that the great-grandchild of middle class parents will be middle class? Markov chains can be used to answer these types of problems.
Section 2.3 Gauss-Jordan Method for General Systems of Equations
Visual Recognition Tutorial
Lecture 4 The Gauß scheme A linear system of equations Matrix algebra deals essentially with linear linear systems. Multiplicative elements. A non-linear.
1 Markov Chains Tom Finke. 2 Overview Outline of presentation The Markov chain model –Description and solution of simplest chain –Study of steady state.
Chapter 4: Stochastic Processes Poisson Processes and Markov Chains
2-1 Sample Spaces and Events Conducting an experiment, in day-to-day repetitions of the measurement the results can differ slightly because of small.
Efficient Estimation of Emission Probabilities in profile HMM By Virpi Ahola et al Reviewed By Alok Datar.
Statistical Background
Readings Chapter 11 textbook
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 60 Chapter 8 Markov Processes.
Computer Animations of Molecular Vibration Michael McGuan and Robert M. Hanson Summer Research 2004 Department of Chemistry St. Olaf College Northfield,
1 A MONTE CARLO EXPERIMENT In the previous slideshow, we saw that the error term is responsible for the variations of b 2 around its fixed component 
DynaTraffic – Models and mathematical prognosis
An overview of a few of the methods used in landscape ecology studies.
Standardized Score, probability & Normal Distribution
Census A survey to collect data on the entire population.   Data The facts and figures collected, analyzed, and summarized for presentation and.
Statistics Primer ORC Staff: Xin Xin (Cindy) Ryan Glaman Brett Kellerstedt 1.
Chapter 6: Vectors & Matrices 1.Introduction to Unit 2 2.(6.1) Vector Structure 3.(6.2) Vector Algebra 4.(6.3) Dynamics: Vectors Changing Over Time 1.Introduction.
10/3/20151 PUAF 610 TA Session 4. 10/3/20152 Some words My –Things to be discussed in TA –Questions on the course and.
Monte Carlo Methods Versatile methods for analyzing the behavior of some activity, plan or process that involves uncertainty.
Dynamical Systems Model of the Simple Genetic Algorithm Introduction to Michael Vose’s Theory Rafal Kicinger Summer Lecture Series 2002.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
Chapter 7 Probability and Samples: The Distribution of Sample Means.
PHARMACOECONOMIC EVALUATIONS & METHODS MARKOV MODELING IN DECISION ANALYSIS FROM THE PHARMACOECONOMICS ON THE INTERNET ®SERIES ©Paul C Langley 2004 Maimon.
M ONTE C ARLO SIMULATION Modeling and Simulation CS
Relative Values. Statistical Terms n Mean:  the average of the data  sensitive to outlying data n Median:  the middle of the data  not sensitive to.
Chapter 2 Statistical Background. 2.3 Random Variables and Probability Distributions A variable X is said to be a random variable (rv) if for every real.
Probability Course web page: vision.cis.udel.edu/cv March 19, 2003  Lecture 15.
ECE-7000: Nonlinear Dynamical Systems Overfitting and model costs Overfitting  The more free parameters a model has, the better it can be adapted.
Landscape ecology methods
The generalization of Bayes for continuous densities is that we have some density f(y|  ) where y and  are vectors of data and parameters with  being.
Review of Matrix Operations Vector: a sequence of elements (the order is important) e.g., x = (2, 1) denotes a vector length = sqrt(2*2+1*1) orientation.
Statistical Estimation Vasileios Hatzivassiloglou University of Texas at Dallas.
GG 313 beginning Chapter 5 Sequences and Time Series Analysis Sequences and Markov Chains Lecture 21 Nov. 12, 2005.
+ Chapter 5 Overview 5.1 Introducing Probability 5.2 Combining Events 5.3 Conditional Probability 5.4 Counting Methods 1.
1 HETEROSCEDASTICITY: WEIGHTED AND LOGARITHMIC REGRESSIONS This sequence presents two methods for dealing with the problem of heteroscedasticity. We will.
10.1 Properties of Markov Chains In this section, we will study a concept that utilizes a mathematical model that combines probability and matrices to.
Why use landscape models?  Models allow us to generate and test hypotheses on systems Collect data, construct model based on assumptions, observe behavior.
Succession A process of ecological change in which a series of natural communities are established and then replaced over time is called_______________________.
Review: Stages in Research Process Formulate Problem Determine Research Design Determine Data Collection Method Design Data Collection Forms Design Sample.
Markov Games TCM Conference 2016 Chris Gann
Near repeat burglary chains: describing the physical and network properties of a network of close burglary pairs. Dr Michael Townsley, UCL Jill Dando Institute.
Goldstein/Schnieder/Lay: Finite Math & Its Applications, 9e 1 of 60 Chapter 8 Markov Processes.
Copyright © Cengage Learning. All rights reserved. 1 Functions and Limits.
Reliability of Disk Systems. Reliability So far, we looked at ways to improve the performance of disk systems. Next, we will look at ways to improve the.
From DeGroot & Schervish. Example Occupied Telephone Lines Suppose that a certain business office has five telephone lines and that any number of these.
10.4 The Algebra of Matrices
Review of Matrix Operations
FW364 Ecological Problem Solving Class 15: Stage Structure
Unit 6 Probability.
Hidden Markov Models Part 2: Algorithms
Chapter 5 Markov Analysis
Landscape ecology methods
Presentation transcript:

Succession Model We talked about the facilitation, inhibition, and tolerance models, but all of these were verbal descriptions Today we are going to consider a mathematical model that describes those processes more precisely and generates predictions that can be tested in the real world

Succession Model To do this, we will develop a matrix model of ecological succession that describes in general terms, the ways in which communities change from one “state” to another through time We can also set of the parameters of the model to describe the processes of facilitation, inhibition, and tolerance

Succession Model We will a Markov model to predict changes in populations and communities Initially we need to define a number of mutually exclusive stages that represent different, discrete communities These stages may represent entire sets of species (e.g. algal mats, encrusting sponges), or they could even represent individuals or stands of a single species (e.g. red oak)

Succession Model When organizing and classifying communities into discrete stages, it may be necessary to make some decisions about stages

Succession Model When choosing the stages for the model implicitly sets the spatial scale of the patch For example, if the stages represent individual species, then a single patch must not be so large as to hold more than one species at a time In addition, there may need to be a open space stage (following a disturbance)

Succession Model Remember, all stages must be independent and in your model, all possible stages must be accounted for

Succession Model Specifying the Time Step Once stages are established, the investigator must specify the time step of the model We will use a discrete time step (hence will not need to use differential equations) This may be years, decades, or days/weeks

Succession Model Constructing the Stage Vector Suppose we have n possible stages for a patch and the landscape consists of a large number of such patches We can then create a stage vector that tells us the number of patches in each of the stages

Succession Model Consider a landscape with 4 patch types: open space, grassland, shrub, and forest If we censused 500 patches we might have the following: s(t) = [250,100,80,70] (t) indicates the stage vector at time t 0’s are possible as some stages may not be represented We can now predict changes through time

Succession Model Constructing the Transition Matrix The transition matrix is slightly different than some other matrices (e.g. Leslie) in both the possible values entered and the interpretation If there are n stages in our model, the transition matrix A will be square, with n rows and n columns

Succession Model Each column of matrix represents the patch state at the current time (t), and each row represents the patch state at the next time step (t+1). The entries are the transition probabilities for change from the current state (column) to the next stage (row)

Succession Model Example of a typical matrix. The probability of moving from grassland (column) to the open state (row) is 0.23 and the probability of moving from forest to grassland is 0.10

Succession Model The stage transitions are not necessarily symmetric. For example, although the probability of moving from grassland to the open state is 0.23, the probability of moving from the open state to grassland is 0.15. The diagonals of the matrix indicate the probability that a patch remains in its current state and does not change

Succession Model Probabilities of remaining in the same state are represented on the diagonals

Succession Model This example points out some of the general properties of transition matrices for succession models. First, notice that all of the entries are positive numbers between 0-1.0 (thus a probability). Second, all values sum to 1.0 (we have included all possible states)

Succession Model Loop Diagrams The transition matrix can be represented by a loop diagram (a circle representing each stage) Use a one-headed arrow to connect two stages

Succession Model Loop diagram for the transition matrix

Succession Model Projecting Community Change The transition matrix summarizes all of the information on how patches change from one state to another The matrix is a set of probabilistic ‘rules’ that determine the patterns of succession that will occur from any possible starting point

Succession Model Using vector s at time t, we can use the transition matrix (A) to determine the number of patches in each state at the next time step (t+1) s(t+1) = As(t) In this example, we had 100 patches in grassland at time t. How many will occur at time t+1?

Succession Model There are four ways in which grassland patches can appear at time t+1: there can be transitions from open space, shrub, or forest and some grassland patches will remain grassland patches GP (t+1) = (0.15)(250) + (0.70)(100) + (0.25)(80) + (0.10)(70) = 134.5

Succession Model e.g. Grass Patches (t+1) = (0.15)(250) + (0.70)(100) + (0.25)(80) + (0.10)(70) = 134.5

Succession Model Remaining patches: OP(t+1)=(0.65)(250) + (0.23)(100) + (0.25)(80) + (0.40)(70) = 233.5 SP(t+1)=0(250)+(0.07)(100)+(0.25)(80)+(0.15)(0.40)(70) = 37.5 FP(t+1)=(0.2)(250)+0(100)+(0.25)(80)+(0.35)(70) = 94.5

Succession Model So we started with the vector: and after one time step, ended up with: s(1) = [233.5, 134.5, 37.5, 94.5] Although the patch states changed, the total number of patches remains the same (500) You can repeat and calculate t+2…

Succession Model Determining the Equilibrium Even though the content of the stage vector keeps changing, remember that the transition matrix A remains the same throughout the process. Consequently, in relatively short time the stage vector reaches an equilibrium state s(t) = [223.03, 164.7, 31.52, 80.75]

Succession Model Once this equilibrium has been reached, there will be no further change in these numbers Interestingly, the same equilibrium vector is reached irrespective of initial patch distribution

Succession Model Successional trajectories for two initial patch vectors: a) [250 100 80 70] & [500 0 0 0]

Succession Model Pg 193

Succession Model Model Variations: Facilitation We can utilize strategically placed 0’s in the matrix, which ensures that patches move through the sequence in orderly fashion

Succession Model Idealized loop diagram for the facilitation model

Succession Model Model Variations: Inhibition In this model, we can assume that each of the 3 community states (grass, shrub, forest) can be replaced by another community state only through an intervening disturbance that frees up space

Succession Model Consequently, stages can only remain as they are or go to the open stage (and then transition into any one of the others)

Succession Model Idealized loop diagram for the inhibition model

Succession Model Model Variations: Tolerance For the tolerance model, assume that all states, including the open state, are equally likely. This generates a transition matrix with identical transition elements. Each community neither inhibits nor facilitates replacement by other communities (therefore equally likely)

Succession Model Notice the equal likelihood in the tolerance model

Succession Model Idealized loop diagram for the tolerance model

Model Comparison Patch trajectories for simple successional model. In each model the initial vector is s(0) = [1000 0 0 0] The inhibition and tolerance matrices settle into their equilbria after a single time step (facilitation takes ~20 steps)

Succession Model Empirical Examples: desert vegetation Can get a good measure of the dynamic nature of desert vegetation (the slow decay allows for relatively good estimate of mortality and patch transition)

Succession Model This matrix is not clearly any of the idealized matrices we have discussed thus far (e.g. Larrea rarely colonizes open space and the seedlings of Larrea are almost always found beneath Ambrosia.

Succession Model This is a type of facilitation, although it does not lead to orderly species replacement as in the classic facilitation model (plus it takes a very long time between steps, a gradual replacement) The diagonals are close to 1.0. So what?

Succession Model It turns out the observed matrix matches the equilibrium stage vector relatively well There is an underrepresentation of Larrea (2.8%) compared to the predicted (9.9%), perhaps due to density-dependent mortality

Succession Model Observed and expected frequencies of patch states

Succession Model This model can be used to forecast how this desert community may respond to a human disturbance

Succession Model Following severe human disturbance, it takes a very long time (~2000 yrs) to settle into equilibrium