Eigenvalues and eigenvectors.

Size: px
Start display at page:

Download "Eigenvalues and eigenvectors."

Transcription

1 Eigenvalues and eigenvectors. Example. A population of a certain animal can be broken into three classes: eggs, juveniles, and adults. Eggs take one year to become juveniles, and juveniles take one year to become adults. Each year, each adult produces an average of 5 eggs. Only 40% of the eggs survive to become juveniles, 50% of the juveniles survive to adulthood, and 80% of adults survive to the next year. Starting with a population of 20 adults, find the long term growth rate of the population. Solution The Leslie Matrix modeling this situation is.4 0 0, and the initial population is Let s see what the population looks like after 25, 26, and 27 years. > (L %^%25) %*% x [1,] [2,] [3,] > sum((l %^%25) %*% x) [1] > (L %^%25) %*% x/sum((l %^%25) %*% x) [1,] [2,] [3,] > (L %^%26) %*% x [1,] [2,] [3,] > sum((l %^%26) %*% x) [1]

2 > (L %^%26) %*% x/sum((l %^%26) %*% x) [1,] [2,] [3,] > (L %^%27) %*% x [1,] [2,] [3,] > sum((l %^%27) %*% x) [1] > (L %^%27) %*% x/sum((l %^%27) %*% x) [1,] [2,] [3,] We ll summarize our findings below. Year Population Total Population Population structure eggs juvs adults eggs juvs adults eggs juvs adults % eggs 19% juvs 17% adults % eggs 19% juvs 17% adults % eggs 19% juvs 17% adults Growth of population since prior year About 35% About 35% It appears that the population is growing at a rate of about 35% per year, and the population seems to have a stable age distribution where about 64% of the population are eggs, 19% are juveniles, and 17% are adults. It would be nice, however, to be able to do all of this a bit more efficiently.

3 Solution 2. If the population reaches a stable age structure, and each group age group in the population is growing by a factor of each year, we ll have In addition, the entries of vector should add to 1 to give the percentage of the population in each age group. In Mathematics, we call an eigenvalue of the matrix L, and we call the vector an eigenvector corresponding to the eigenvalue. As you d guess, R easily does these things, although to get the vector x to look exactly the way we want, we have to work just a little. In R, the eigen command will do these things. > eigen(l) [1] i i i [,2] [,3] [1,] i i i [2,] i i i [3,] i i i In general, an n by n matrix has n eigenvalues, and it is true (but by no means obvious!) that every Leslie matrix has a dominant (or largest) real eigenvalue, which tells the long term rate at which the population is changing. In this case, it s 1.35 which is telling us that in the long run the population will grow by a factor of 1.35 (or 35%) each year. Under, column 1 is an eigenvector for 1.35, column 2 is an eigenvector for , and column 3 is an eigenvector for To find the stable age distribution, we want the eigenvector corresponding to the dominant real eigenvalue. However, we want to modify that eigenvector so its entries sum to 1. Here s where your R knowledge is put to the test. The command > x = eigen(l) will lift off the eigenvector in question. We look inside the object eigen(l), extract the information in the part of that data frame named vectors (), and since that gives the three eigenvectors as a 3 by 3 matrix, we lift out column 1 () of that. > x [1] i i i Finally, the easiest way to make x sum to 1 is to take each entry in x and divide by the sum of x s entries. > x/sum(x) [1] i i i

4 Not surprisingly, this vector tells us that in the long run, about 64% of the population will be in age class 1 (eggs), 19% will be in age class 2 (juveniles), and 17% will be in age class 3 (adults). Example. Take the previous example with some modifications. Only 10% of eggs survive, only 20% of juveniles survive to adulthood, and each adult produces an average of only 2 eggs. Here the Leslie matrix is > L = matrix(c(0,0,2,.1,0,0,0,.2,.8), nrow=3, ncol=3, byrow=true) > eigen(l) [1] i i i [,2] [,3] [1,] i i i [2,] i i i [3,] i i i Here the dominant eigenvalue is 0.85, indicating that in the long run, the next year s population will be only 85% of what it was the year before. Thus, this population will eventually go extinct. Example. See the example on the previous handout which discussed the Moran model. 1 2/ /9 2/9 0 The matrix of that process was 0 2/9 5/ /9 1 and the four states corresponded to 0, 1, 2, and 3 type A individuals in the population. Let find the eigenvalues and corresponding eigenvectors of this matrix.

5 > N = matrix(c(1,0,0,0,2/9,5/9,2/9,0,0,2/9,5/9,2/9,0,0,0,1), nrow=4, ncol=4) > eigen(n) [1] [,2] [,3] [,4] [1,] [2,] [3,] [4,] Notice that 1 shows up twice as an eigenvalue, or has multiplicity 2 as you d say in college algebra (in fact 1 will always be an eigenvalue of any matrix of a Markov chain), and there are two different eigenvectors corresponding to this eigenvalue and are telling you that there are two possible long term states to this system. Either we end up in state 1 (where the A s die out) forever or we end up in state 4 (where the B s die out) forever. Note from the earlier example, the probability of eventually reaching either of these so called absorbing states depends heavily on which state we started in. Example. A certain disease has 4 possible states. The disease is either in remission, stage 1, stage 2, or stage 3. During any given year: If the disease is currently in remission, there is a 5% chance it will advance to stage 1 during the next year; otherwise it stays in remission. If it s currently in stage 1, there is a 40% chance it will go into remission, a 50% chance it will stay stage 1, and a 10% chance it will advance to stage 2. If it s currently in stage 2, there s a 30% chance it goes into remission, a 30% chance it stays stage 2, and a 40% chance it goes to state 3. Stage 3 is when the condition is terminal. Once the disease is at this stage, it stays that way until the death of the diseased. Discuss how this disease runs its course. Solution First, note that is the matrix of this Markov chain. And, from here on, I ll stop writing down the R commands needed to produce matrices.

6 > eigen(d) [1] [,2] [,3] [,4] [1,] [2,] [3,] [4,] This is not horribly enlightening, as this tells us that eventually (if they live long enough!) the patient will end up in the terminal state. This is why when dealing with terminal conditions, one usually speaks of 5 year or 10 year prognoses. > D %^% 5 [,2] [,3] [,4] [1,] [2,] [3,] [4,] > D %^% 10 [,2] [,3] [,4] [1,] [2,] [3,] [4,] For instance, if the patient is currently in remission, there is about an 89% probability they will also be in remission 5 years from now. If the patient is currently in remission, there s about a 3.5% probability they will be terminal in 10 years, and if they are currently stage 2, there is a 58% probability they will be terminal in ten years. Now, the following is impractical (for a human patient anyway!), but it illustrates something useful. > round(d %^% 5000, 3) [,2] [,3] [,4] [1,] [2,] [3,] [4,] If you let this process do its thing for 5000 years, we basically end up in the terminal state with probability 1, regardless of the starting state.

7 Example. There are three geographic areas in which a certain mammal lives, and these critters migrate. In any given year, 15% of the animals in area A migrate to area B, 5% migrate to C, and the rest stay put. 5% of the animals in B migrate to A, 5% migrate to C, and the rest stay put. 10% of the animals in C migrate to A, 20% migrate to B, and the rest stay put. What will be the long term state of such a system (of course, conveniently ignoring births, deaths and a hundred other things!)? Solution. First set up the transition matrix; we ll call it D. > D = matrix(c(.8,.05,.1,.15,.9,.2,.05,.05,.7), nrow=3, ncol=3, byrow=true) > D [,2] [,3] [1,] [2,] [3,] > eigen(d) [1] Not surprisingly, the dominant eigenvalue is 1, which tells us that the population is neither growing or shrinking (there s no births or deaths in this model!). [,2] [,3] [1,] e [2,] e [3,] e As before, the eigenvector for the eigenvalue 1 (scaled appropriately!) should give the long term state of the system. > x = eigen(d) > x/sum(x) [1] This tells us that eventually, about 23% of the population will end up in area A, 63% will reside in B, and the other 14% will be in C. The calculation > D %^% 100 [,2] [,3] [1,] [2,] [3,] shows that if you let this process run for 100 years, the population will have the same distribution (or at least very close to it) regardless of the initial distribution of the population.

Leslie matrices and Markov chains.

Leslie matrices and Markov chains. Leslie matrices and Markov chains. Example. Suppose a certain species of insect can be divided into 2 classes, eggs and adults. 10% of eggs survive for 1 week to become adults, each adult yields an average

More information

Lecture 10: Powers of Matrices, Difference Equations

Lecture 10: Powers of Matrices, Difference Equations Lecture 10: Powers of Matrices, Difference Equations Difference Equations A difference equation, also sometimes called a recurrence equation is an equation that defines a sequence recursively, i.e. each

More information

Markov Chains Handout for Stat 110

Markov Chains Handout for Stat 110 Markov Chains Handout for Stat 0 Prof. Joe Blitzstein (Harvard Statistics Department) Introduction Markov chains were first introduced in 906 by Andrey Markov, with the goal of showing that the Law of

More information

[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]

[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.] Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the

More information

Markov Chains and Pandemics

Markov Chains and Pandemics Markov Chains and Pandemics Caleb Dedmore and Brad Smith December 8, 2016 Page 1 of 16 Abstract Markov Chain Theory is a powerful tool used in statistical analysis to make predictions about future events

More information

Section 1.1 Algorithms. Key terms: Algorithm definition. Example from Trapezoidal Rule Outline of corresponding algorithm Absolute Error

Section 1.1 Algorithms. Key terms: Algorithm definition. Example from Trapezoidal Rule Outline of corresponding algorithm Absolute Error Section 1.1 Algorithms Key terms: Algorithm definition Example from Trapezoidal Rule Outline of corresponding algorithm Absolute Error Approximating square roots Iterative method Diagram of a general iterative

More information

Math 2J Lecture 16-11/02/12

Math 2J Lecture 16-11/02/12 Math 2J Lecture 16-11/02/12 William Holmes Markov Chain Recap The population of a town is 100000. Each person is either independent, democrat, or republican. In any given year, each person can choose to

More information

Markov Chains. As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006.

Markov Chains. As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006. Markov Chains As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006 1 Introduction A (finite) Markov chain is a process with a finite number of states (or outcomes, or

More information

Linear Algebra Practice Problems

Linear Algebra Practice Problems Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a

More information

Further Mathematical Methods (Linear Algebra) 2002

Further Mathematical Methods (Linear Algebra) 2002 Further Mathematical Methods (Linear Algebra) 2002 Solutions For Problem Sheet 4 In this Problem Sheet, we revised how to find the eigenvalues and eigenvectors of a matrix and the circumstances under which

More information

Eigenvalues and eigenvectors

Eigenvalues and eigenvectors Roberto s Notes on Linear Algebra Chapter 0: Eigenvalues and diagonalization Section Eigenvalues and eigenvectors What you need to know already: Basic properties of linear transformations. Linear systems

More information

Eigenvalues & Eigenvectors

Eigenvalues & Eigenvectors Eigenvalues & Eigenvectors Page 1 Eigenvalues are a very important concept in linear algebra, and one that comes up in other mathematics courses as well. The word eigen is German for inherent or characteristic,

More information

A simple dynamic model of labor market

A simple dynamic model of labor market 1 A simple dynamic model of labor market Let e t be the number of employed workers, u t be the number of unemployed worker. An employed worker has probability of 0.8 to be employed in the next period,

More information

MATH 446/546 Test 2 Fall 2014

MATH 446/546 Test 2 Fall 2014 MATH 446/546 Test 2 Fall 204 Note the problems are separated into two sections a set for all students and an additional set for those taking the course at the 546 level. Please read and follow all of these

More information

5. DISCRETE DYNAMICAL SYSTEMS

5. DISCRETE DYNAMICAL SYSTEMS 5 DISCRETE DYNAMICAL SYSTEMS In Chapter 5, we considered the dynamics of systems consisting of a single quantity in either discrete or continuous time Here we consider the dynamics of certain systems consisting

More information

Math 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time

Math 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time Math 416 Lecture 11 Math 416 Lecture 16 Exam 2 next time Birth and death processes, queueing theory In arrival processes, the state only jumps up. In a birth-death process, it can either jump up or down

More information

The Leslie Matrix Part II

The Leslie Matrix Part II The Leslie Matrix Part II Math 45 Linear Algebra David Arnold and Kevin Yokoyama David-Arnold@Eurekaredwoodscccaus Abstract The Leslie Model is a powerful tool used to determine the growth of a population

More information

Chapter 29 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M.

Chapter 29 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. 29 Markov Chains Definition of a Markov Chain Markov chains are one of the most fun tools of probability; they give a lot of power for very little effort. We will restrict ourselves to finite Markov chains.

More information

Homework set 2 - Solutions

Homework set 2 - Solutions Homework set 2 - Solutions Math 495 Renato Feres Simulating a Markov chain in R Generating sample sequences of a finite state Markov chain. The following is a simple program for generating sample sequences

More information

Modeling Prey and Predator Populations

Modeling Prey and Predator Populations Modeling Prey and Predator Populations Alison Pool and Lydia Silva December 15, 2006 Abstract In this document, we will explore the modeling of two populations based on their relation to one another. Specifically

More information

9 Demography. 9.1 Survival. last revised: 25 February 2009

9 Demography. 9.1 Survival. last revised: 25 February 2009 last revised: 25 February 2009 9 Demography We have already considered population dynamics and growth using the differential reproduction model in Chapter 3. For simplicity, that model assumed that the

More information

SENSITIVITY AND ELASTICITY ANALYSES

SENSITIVITY AND ELASTICITY ANALYSES 1 SENSITIVITY AND ELASTICITY ANALYSES Objectives Using the stage-based matrix model for a sea turtle population, conduct a sensitivity analysis of model parameters to determine the absolute contribution

More information

A&S 320: Mathematical Modeling in Biology

A&S 320: Mathematical Modeling in Biology A&S 320: Mathematical Modeling in Biology David Murrugarra Department of Mathematics, University of Kentucky http://www.ms.uky.edu/~dmu228/as320/ Spring 2016 David Murrugarra (University of Kentucky) A&S

More information

Iterated Functions. Tom Davis November 5, 2009

Iterated Functions. Tom Davis   November 5, 2009 Iterated Functions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November 5, 2009 Abstract In this article we will examine various properties of iterated functions. If f(x) is a

More information

MATH 310, REVIEW SHEET 2

MATH 310, REVIEW SHEET 2 MATH 310, REVIEW SHEET 2 These notes are a very short summary of the key topics in the book (and follow the book pretty closely). You should be familiar with everything on here, but it s not comprehensive,

More information

Solutions: 6.2 FE 1: If f is linear what is f( Solution: ) = FE 6: The fuction g : R 2 R 2 is linear Since = what is g( Solution:

Solutions: 6.2 FE 1: If f is linear what is f( Solution: ) = FE 6: The fuction g : R 2 R 2 is linear Since = what is g( Solution: Solutions: 6 FE : If f is linear what is f(? f( 6 FE 6: The fuction g : R R is linear ( 5 ( g( g( Since ( 5 ( + ( what is g( (? 5g ( + g( ( ( + ( 5 8 5 + 5 ( g( g(5 6 FE 9: Multiply: (a (b (c [ ] ( [ ]

More information

, some directions, namely, the directions of the 1. and

, some directions, namely, the directions of the 1. and 11. Eigenvalues and eigenvectors We have seen in the last chapter: for the centroaffine mapping, some directions, namely, the directions of the 1 coordinate axes: and 0 0, are distinguished 1 among all

More information

MAT1302F Mathematical Methods II Lecture 19

MAT1302F Mathematical Methods II Lecture 19 MAT302F Mathematical Methods II Lecture 9 Aaron Christie 2 April 205 Eigenvectors, Eigenvalues, and Diagonalization Now that the basic theory of eigenvalues and eigenvectors is in place most importantly

More information

Answers Lecture 2 Stochastic Processes and Markov Chains, Part2

Answers Lecture 2 Stochastic Processes and Markov Chains, Part2 Answers Lecture 2 Stochastic Processes and Markov Chains, Part2 Question 1 Question 1a Solve system of equations: (1 a)φ 1 + bφ 2 φ 1 φ 1 + φ 2 1. From the second equation we obtain φ 2 1 φ 1. Substitition

More information

The Genetics of Natural Selection

The Genetics of Natural Selection The Genetics of Natural Selection Introduction So far in this course, we ve focused on describing the pattern of variation within and among populations. We ve talked about inbreeding, which causes genotype

More information

Eigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A.

Eigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A. Eigenspaces 1. (a) Find all eigenvalues and eigenvectors of A = (b) Find the corresponding eigenspaces. [ ] 1 1 1 Definition. If A is an n n matrix and λ is a scalar, the λ-eigenspace of A (usually denoted

More information

Getting Started with Communications Engineering

Getting Started with Communications Engineering 1 Linear algebra is the algebra of linear equations: the term linear being used in the same sense as in linear functions, such as: which is the equation of a straight line. y ax c (0.1) Of course, if we

More information

Notes on the Matrix-Tree theorem and Cayley s tree enumerator

Notes on the Matrix-Tree theorem and Cayley s tree enumerator Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will

More information

The Eigenvector. [12] The Eigenvector

The Eigenvector. [12] The Eigenvector The Eigenvector [ The Eigenvector Two interest-bearing accounts Suppose Account yields 5% interest and Account yields 3% interest. Represent balances in the two accounts by a -vector x (t) = x (t+) = [.05

More information

= main diagonal, in the order in which their corresponding eigenvectors appear as columns of E.

= main diagonal, in the order in which their corresponding eigenvectors appear as columns of E. 3.3 Diagonalization Let A = 4. Then and are eigenvectors of A, with corresponding eigenvalues 2 and 6 respectively (check). This means 4 = 2, 4 = 6. 2 2 2 2 Thus 4 = 2 2 6 2 = 2 6 4 2 We have 4 = 2 0 0

More information

Unit 1 Lesson 3 Population Dynamics. Copyright Houghton Mifflin Harcourt Publishing Company

Unit 1 Lesson 3 Population Dynamics. Copyright Houghton Mifflin Harcourt Publishing Company Movin Out How can a population grow or get smaller? If new individuals are added to the population, it grows. If individuals are removed from a population, it gets smaller. The population stays at about

More information

Lectures on Probability and Statistical Models

Lectures on Probability and Statistical Models Lectures on Probability and Statistical Models Phil Pollett Professor of Mathematics The University of Queensland c These materials can be used for any educational purpose provided they are are not altered

More information

Finite-Horizon Statistics for Markov chains

Finite-Horizon Statistics for Markov chains Analyzing FSDT Markov chains Friday, September 30, 2011 2:03 PM Simulating FSDT Markov chains, as we have said is very straightforward, either by using probability transition matrix or stochastic update

More information

FIBONACCI S NUMBERS, A POPULATION MODEL, AND POWERS OF MATRICES

FIBONACCI S NUMBERS, A POPULATION MODEL, AND POWERS OF MATRICES FIBONACCI S NUMBERS, A POPULATION MODEL, AND POWERS OF MATRICES The goal of these notes is to illustrate an application of large powers of matrices Our primary tools are the eigenvalues and eigenvectors

More information

CHAPTER 5. Interactions in the Ecosystem

CHAPTER 5. Interactions in the Ecosystem CHAPTER 5 Interactions in the Ecosystem 1 SECTION 3.3 - THE ECOSYSTEM 2 SECTION 3.3 - THE ECOSYSTEM Levels of Organization Individual one organism from a species. Species a group of organisms so similar

More information

Elementary Linear Algebra Review for Exam 3 Exam is Friday, December 11th from 1:15-3:15

Elementary Linear Algebra Review for Exam 3 Exam is Friday, December 11th from 1:15-3:15 Elementary Linear Algebra Review for Exam 3 Exam is Friday, December th from :5-3:5 The exam will cover sections: 6., 6.2, 7. 7.4, and the class notes on dynamical systems. You absolutely must be able

More information

Math 304 Handout: Linear algebra, graphs, and networks.

Math 304 Handout: Linear algebra, graphs, and networks. Math 30 Handout: Linear algebra, graphs, and networks. December, 006. GRAPHS AND ADJACENCY MATRICES. Definition. A graph is a collection of vertices connected by edges. A directed graph is a graph all

More information

Confidence intervals

Confidence intervals Confidence intervals We now want to take what we ve learned about sampling distributions and standard errors and construct confidence intervals. What are confidence intervals? Simply an interval for which

More information

CONTENTS. Preface List of Symbols and Notation

CONTENTS. Preface List of Symbols and Notation CONTENTS Preface List of Symbols and Notation xi xv 1 Introduction and Review 1 1.1 Deterministic and Stochastic Models 1 1.2 What is a Stochastic Process? 5 1.3 Monte Carlo Simulation 10 1.4 Conditional

More information

The probability of going from one state to another state on the next trial depends only on the present experiment and not on past history.

The probability of going from one state to another state on the next trial depends only on the present experiment and not on past history. c Dr Oksana Shatalov, Fall 2010 1 9.1: Markov Chains DEFINITION 1. Markov process, or Markov Chain, is an experiment consisting of a finite number of stages in which the outcomes and associated probabilities

More information

Systems of Linear ODEs

Systems of Linear ODEs P a g e 1 Systems of Linear ODEs Systems of ordinary differential equations can be solved in much the same way as discrete dynamical systems if the differential equations are linear. We will focus here

More information

The Leslie Matrix. The Leslie Matrix (/2)

The Leslie Matrix. The Leslie Matrix (/2) The Leslie Matrix The Leslie matrix is a generalization of the above. It describes annual increases in various age categories of a population. As above we write p n+1 = Ap n where p n, A are given by:

More information

Row Reduction

Row Reduction Row Reduction 1-12-2015 Row reduction (or Gaussian elimination) is the process of using row operations to reduce a matrix to row reduced echelon form This procedure is used to solve systems of linear equations,

More information

The Boundary Problem: Markov Chain Solution

The Boundary Problem: Markov Chain Solution MATH 529 The Boundary Problem: Markov Chain Solution Consider a random walk X that starts at positive height j, and on each independent step, moves upward a units with probability p, moves downward b units

More information

Volume vs. Diameter. Teacher Lab Discussion. Overview. Picture, Data Table, and Graph

Volume vs. Diameter. Teacher Lab Discussion. Overview. Picture, Data Table, and Graph 5 6 7 Middle olume Length/olume vs. Diameter, Investigation page 1 of olume vs. Diameter Teacher Lab Discussion Overview Figure 1 In this experiment we investigate the relationship between the diameter

More information

Eigenvalues in Applications

Eigenvalues in Applications Eigenvalues in Applications Abstract We look at the role of eigenvalues and eigenvectors in various applications. Specifically, we consider differential equations, Markov chains, population growth, and

More information

ECE 501b Homework #4 Due: 10/22/2012

ECE 501b Homework #4 Due: 10/22/2012 1. Game Strategy: Consider a multiplayer boardgame that takes place on the following board and with the following rules: 7 8 9 10 6 11 5 12 4 3 2 1 The board contains six squares that are property (the

More information

Notes for CS542G (Iterative Solvers for Linear Systems)

Notes for CS542G (Iterative Solvers for Linear Systems) Notes for CS542G (Iterative Solvers for Linear Systems) Robert Bridson November 20, 2007 1 The Basics We re now looking at efficient ways to solve the linear system of equations Ax = b where in this course,

More information

Practice problems for Exam 3 A =

Practice problems for Exam 3 A = Practice problems for Exam 3. Let A = 2 (a) Determine whether A is diagonalizable. If so, find a matrix S such that S AS is diagonal. If not, explain why not. (b) What are the eigenvalues of A? Is A diagonalizable?

More information

At the boundary states, we take the same rules except we forbid leaving the state space, so,.

At the boundary states, we take the same rules except we forbid leaving the state space, so,. Birth-death chains Monday, October 19, 2015 2:22 PM Example: Birth-Death Chain State space From any state we allow the following transitions: with probability (birth) with probability (death) with probability

More information

Chapter 6. Logistic Regression. 6.1 A linear model for the log odds

Chapter 6. Logistic Regression. 6.1 A linear model for the log odds Chapter 6 Logistic Regression In logistic regression, there is a categorical response variables, often coded 1=Yes and 0=No. Many important phenomena fit this framework. The patient survives the operation,

More information

A Note on the Eigenvalues and Eigenvectors of Leslie matrices. Ralph Howard Department of Mathematics University of South Carolina

A Note on the Eigenvalues and Eigenvectors of Leslie matrices. Ralph Howard Department of Mathematics University of South Carolina A Note on the Eigenvalues and Eigenvectors of Leslie matrices Ralph Howard Department of Mathematics University of South Carolina Vectors and Matrices A size n vector, v, is a list of n numbers put in

More information

The Cayley-Hamilton Theorem and the Jordan Decomposition

The Cayley-Hamilton Theorem and the Jordan Decomposition LECTURE 19 The Cayley-Hamilton Theorem and the Jordan Decomposition Let me begin by summarizing the main results of the last lecture Suppose T is a endomorphism of a vector space V Then T has a minimal

More information

14.1. KEY CONCEPT Every organism has a habitat and a niche. 38 Reinforcement Unit 5 Resource Book

14.1. KEY CONCEPT Every organism has a habitat and a niche. 38 Reinforcement Unit 5 Resource Book 14.1 HABITAT AND NICHE KEY CONCEPT Every organism has a habitat and a niche. A habitat is all of the living and nonliving factors in the area where an organism lives. For example, the habitat of a frog

More information

http://www.math.uah.edu/stat/markov/.xhtml 1 of 9 7/16/2009 7:20 AM Virtual Laboratories > 16. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 1. A Markov process is a random process in which the future is

More information

Primary Objectives. Content Standards (CCSS) Mathematical Practices (CCMP) Materials. Before Beginning

Primary Objectives. Content Standards (CCSS) Mathematical Practices (CCMP) Materials. Before Beginning THE FALL OF JAVERT Could Inspector Javert have survived the fall? Mathalicious 2013 lesson guide At the end of the popular musical Les Misérables, a dejected Inspector Javert throws himself off a bridge

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing

More information

Normal modes. where. and. On the other hand, all such systems, if started in just the right way, will move in a simple way.

Normal modes. where. and. On the other hand, all such systems, if started in just the right way, will move in a simple way. Chapter 9. Dynamics in 1D 9.4. Coupled motions in 1D 491 only the forces from the outside; the interaction forces cancel because they come in equal and opposite (action and reaction) pairs. So we get:

More information

Discrete time Markov chains. Discrete Time Markov Chains, Limiting. Limiting Distribution and Classification. Regular Transition Probability Matrices

Discrete time Markov chains. Discrete Time Markov Chains, Limiting. Limiting Distribution and Classification. Regular Transition Probability Matrices Discrete time Markov chains Discrete Time Markov Chains, Limiting Distribution and Classification DTU Informatics 02407 Stochastic Processes 3, September 9 207 Today: Discrete time Markov chains - invariant

More information

MITOCW ocw f99-lec30_300k

MITOCW ocw f99-lec30_300k MITOCW ocw-18.06-f99-lec30_300k OK, this is the lecture on linear transformations. Actually, linear algebra courses used to begin with this lecture, so you could say I'm beginning this course again by

More information

Recitation 9: Probability Matrices and Real Symmetric Matrices. 3 Probability Matrices: Definitions and Examples

Recitation 9: Probability Matrices and Real Symmetric Matrices. 3 Probability Matrices: Definitions and Examples Math b TA: Padraic Bartlett Recitation 9: Probability Matrices and Real Symmetric Matrices Week 9 Caltech 20 Random Question Show that + + + + +... = ϕ, the golden ratio, which is = + 5. 2 2 Homework comments

More information

6.842 Randomness and Computation March 3, Lecture 8

6.842 Randomness and Computation March 3, Lecture 8 6.84 Randomness and Computation March 3, 04 Lecture 8 Lecturer: Ronitt Rubinfeld Scribe: Daniel Grier Useful Linear Algebra Let v = (v, v,..., v n ) be a non-zero n-dimensional row vector and P an n n

More information

Markov Chains and Related Matters

Markov Chains and Related Matters Markov Chains and Related Matters 2 :9 3 4 : The four nodes are called states. The numbers on the arrows are called transition probabilities. For example if we are in state, there is a probability of going

More information

Chapter 1: January 26 January 30

Chapter 1: January 26 January 30 Chapter : January 26 January 30 Section.7: Inequalities As a diagnostic quiz, I want you to go through the first ten problems of the Chapter Test on page 32. These will test your knowledge of Sections.

More information

n α 1 α 2... α m 1 α m σ , A =

n α 1 α 2... α m 1 α m σ , A = The Leslie Matrix The Leslie matrix is a generalization of the above. It is a matrix which describes the increases in numbers in various age categories of a population year-on-year. As above we write p

More information

Understanding Populations Section 1. Chapter 8 Understanding Populations Section1, How Populations Change in Size DAY ONE

Understanding Populations Section 1. Chapter 8 Understanding Populations Section1, How Populations Change in Size DAY ONE Chapter 8 Understanding Populations Section1, How Populations Change in Size DAY ONE What Is a Population? A population is a group of organisms of the same species that live in a specific geographical

More information

Autonomous Systems and Stability

Autonomous Systems and Stability LECTURE 8 Autonomous Systems and Stability An autonomous system is a system of ordinary differential equations of the form 1 1 ( 1 ) 2 2 ( 1 ). ( 1 ) or, in vector notation, x 0 F (x) That is to say, an

More information

SARAH P. OTTO and TROY DAY

SARAH P. OTTO and TROY DAY A Biologist's Guide to Mathematical Modeling in Ecology and Evolution SARAH P. OTTO and TROY DAY Univsr?.ltats- und Lender bibliolhek Darmstadt Bibliothek Biotogi Princeton University Press Princeton and

More information

ODEs. September 7, Consider the following system of two coupled first-order ordinary differential equations (ODEs): A =

ODEs. September 7, Consider the following system of two coupled first-order ordinary differential equations (ODEs): A = ODEs September 7, 2017 In [1]: using Interact, PyPlot 1 Exponential growth and decay Consider the following system of two coupled first-order ordinary differential equations (ODEs): d x/dt = A x for the

More information

Lecture Notes: Markov chains Tuesday, September 16 Dannie Durand

Lecture Notes: Markov chains Tuesday, September 16 Dannie Durand Computational Genomics and Molecular Biology, Lecture Notes: Markov chains Tuesday, September 6 Dannie Durand In the last lecture, we introduced Markov chains, a mathematical formalism for modeling how

More information

Lecture 6: Lies, Inner Product Spaces, and Symmetric Matrices

Lecture 6: Lies, Inner Product Spaces, and Symmetric Matrices Math 108B Professor: Padraic Bartlett Lecture 6: Lies, Inner Product Spaces, and Symmetric Matrices Week 6 UCSB 2014 1 Lies Fun fact: I have deceived 1 you somewhat with these last few lectures! Let me

More information

2. Transience and Recurrence

2. Transience and Recurrence Virtual Laboratories > 15. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 2. Transience and Recurrence The study of Markov chains, particularly the limiting behavior, depends critically on the random times

More information

Princeton University Press, all rights reserved. Chapter 10: Dynamics of Class-Structured Populations

Princeton University Press, all rights reserved. Chapter 10: Dynamics of Class-Structured Populations Supplementary material to: Princeton University Press, all rights reserved From: Chapter 10: Dynamics of Class-Structured Populations A Biologist s Guide to Mathematical Modeling in Ecology and Evolution

More information

CHAPTER 6. Markov Chains

CHAPTER 6. Markov Chains CHAPTER 6 Markov Chains 6.1. Introduction A(finite)Markovchainisaprocess withafinitenumberofstates (or outcomes, or events) in which the probability of being in a particular state at step n+1depends only

More information

All living organisms are limited by factors in the environment

All living organisms are limited by factors in the environment All living organisms are limited by factors in the environment Monday, October 30 POPULATION ECOLOGY Monday, October 30 POPULATION ECOLOGY Population Definition Root of the word: The word in another language

More information

88 CONTINUOUS MARKOV CHAINS

88 CONTINUOUS MARKOV CHAINS 88 CONTINUOUS MARKOV CHAINS 3.4. birth-death. Continuous birth-death Markov chains are very similar to countable Markov chains. One new concept is explosion which means that an infinite number of state

More information

14.1 Habitat And Niche

14.1 Habitat And Niche 14.1 Habitat And Niche A habitat differs from a niche. Habitat physical area in which an organism lives Niche each species plays a specific role in an ecosystem niche includes the species habitat, feeding

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors MAT 67L, Laboratory III Contents Instructions (1) Read this document. (2) The questions labeled Experiments are not graded, and should not be turned in. They are designed for

More information

642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004

642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004 642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004 Introduction Square matrices whose entries are all nonnegative have special properties. This was mentioned briefly in Section

More information

Chapter 10 3/7/2017. Avogadro s Number and the Mole. Why don t we count other things by the mole?

Chapter 10 3/7/2017. Avogadro s Number and the Mole. Why don t we count other things by the mole? Avogadro s Number and the Mole Chapter 10 Many words represent a quantity Chemical Quantities Atoms are so tiny, that counting them by the dozen would be ridiculous! Chemists count by the mole. 1 mole

More information

Section 4.1 The Power Method

Section 4.1 The Power Method Section 4.1 The Power Method Key terms Dominant eigenvalue Eigenpair Infinity norm and 2-norm Power Method Scaled Power Method Power Method for symmetric matrices The notation used varies a bit from that

More information

Note: Please use the actual date you accessed this material in your citation.

Note: Please use the actual date you accessed this material in your citation. MIT OpenCourseWare http://ocw.mit.edu 18.06 Linear Algebra, Spring 2005 Please use the following citation format: Gilbert Strang, 18.06 Linear Algebra, Spring 2005. (Massachusetts Institute of Technology:

More information

PageRank: The Math-y Version (Or, What To Do When You Can t Tear Up Little Pieces of Paper)

PageRank: The Math-y Version (Or, What To Do When You Can t Tear Up Little Pieces of Paper) PageRank: The Math-y Version (Or, What To Do When You Can t Tear Up Little Pieces of Paper) In class, we saw this graph, with each node representing people who are following each other on Twitter: Our

More information

Roberto s Notes on Linear Algebra Chapter 9: Orthogonality Section 2. Orthogonal matrices

Roberto s Notes on Linear Algebra Chapter 9: Orthogonality Section 2. Orthogonal matrices Roberto s Notes on Linear Algebra Chapter 9: Orthogonality Section 2 Orthogonal matrices What you need to know already: What orthogonal and orthonormal bases for subspaces are. What you can learn here:

More information

Chapter 1. Vectors, Matrices, and Linear Spaces

Chapter 1. Vectors, Matrices, and Linear Spaces 1.7 Applications to Population Distributions 1 Chapter 1. Vectors, Matrices, and Linear Spaces 1.7. Applications to Population Distributions Note. In this section we break a population into states and

More information

Ch. 4 - Population Ecology

Ch. 4 - Population Ecology Ch. 4 - Population Ecology Ecosystem all of the living organisms and nonliving components of the environment in an area together with their physical environment How are the following things related? mice,

More information

THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS

THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS KEITH CONRAD. Introduction The easiest matrices to compute with are the diagonal ones. The sum and product of diagonal matrices can be computed componentwise

More information

Next is material on matrix rank. Please see the handout

Next is material on matrix rank. Please see the handout B90.330 / C.005 NOTES for Wednesday 0.APR.7 Suppose that the model is β + ε, but ε does not have the desired variance matrix. Say that ε is normal, but Var(ε) σ W. The form of W is W w 0 0 0 0 0 0 w 0

More information

MAS275 Probability Modelling Exercises

MAS275 Probability Modelling Exercises MAS75 Probability Modelling Exercises Note: these questions are intended to be of variable difficulty. In particular: Questions or part questions labelled (*) are intended to be a bit more challenging.

More information

18.600: Lecture 32 Markov Chains

18.600: Lecture 32 Markov Chains 18.600: Lecture 32 Markov Chains Scott Sheffield MIT Outline Markov chains Examples Ergodicity and stationarity Outline Markov chains Examples Ergodicity and stationarity Markov chains Consider a sequence

More information

EXAMPLE 7: EIGENVALUE PROBLEM EXAMPLE. x ks1. ks2. fs1. fs2 !!! +!!! =!!!!! 4) State variables:!!!,!!!,!!!,!!! (Four SV s here!) =!!!

EXAMPLE 7: EIGENVALUE PROBLEM EXAMPLE. x ks1. ks2. fs1. fs2 !!! +!!! =!!!!! 4) State variables:!!!,!!!,!!!,!!! (Four SV s here!) =!!! EXAMPLE 7: EIGENVALUE PROBLEM EXAMPLE x ks ks m m ) CL: ) GC: 3) FBD: fs fs fs m m + 4) State variables:,,, (Four SV s here) 5) Solve for the state equations for each variable + + Wow, that was one of

More information

2011/04 LEUKAEMIA IN WALES Welsh Cancer Intelligence and Surveillance Unit

2011/04 LEUKAEMIA IN WALES Welsh Cancer Intelligence and Surveillance Unit 2011/04 LEUKAEMIA IN WALES 1994-2008 Welsh Cancer Intelligence and Surveillance Unit Table of Contents 1 Definitions and Statistical Methods... 2 2 Results 7 2.1 Leukaemia....... 7 2.2 Acute Lymphoblastic

More information

Factoring. there exists some 1 i < j l such that x i x j (mod p). (1) p gcd(x i x j, n).

Factoring. there exists some 1 i < j l such that x i x j (mod p). (1) p gcd(x i x j, n). 18.310 lecture notes April 22, 2015 Factoring Lecturer: Michel Goemans We ve seen that it s possible to efficiently check whether an integer n is prime or not. What about factoring a number? If this could

More information

The Derivative of a Function

The Derivative of a Function The Derivative of a Function James K Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University March 1, 2017 Outline A Basic Evolutionary Model The Next Generation

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing

More information