Navigation Wheel

 
 
What is this section about?
The Markov Chain model and process uses three important kinds of modern mathematics: probability, matrices, and time-stepping.

Prerequisites:

1. Knowledge of probability theory up to conditional probability.
2. Knowledge of matrices used as transformations

Objectives:

  • To see how the simplest (2-link) Markov chain works. In particular, to see a type of situation in which a Markov chain can be used.
  • To see (visually) how to describe the situation.
  • To see (numerically) how to describe the situation.

Start the tutorial

 

Intro to Modeling
Intro to Statistics
Random Numbers
Random Walk
Markov Chains
Monte Carlo
Diffusion
Ising Model
Cell Potts Model
Parallel Computing
Myxobacteria
Microtubules

 

 
 

Nome

University of Notre Dame
Notre Dame, Indiana 46556
Phone: 574-631-5000
Copyright © 2006 University of Notre Dame
Last modified: July 08, 2007 02:57 PM