Home / Series / Discrete Mathematics / Aired Order / Season 1 / Episode 17

Ways to Walk—Matrices and Markov Chains

Use matrices to answer the question, How many ways are there to "walk" from one vertex to another in a given graph? This exercise leads to a discussion of random walks on graphs and the technique used by many search engines to rank web pages.

English
  • Runtime 30 minutes
  • Created November 3, 2010 by
    Administrator admin
  • Modified November 3, 2010 by
    Administrator admin