Lecture 20: Markov Processes and Random Walks
author: Robert G. Gallager,
Center for Future Civic Media, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 11, 2013, recorded: April 2011, views: 2212
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 11, 2013, recorded: April 2011, views: 2212
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
After reviewing steady-state, this lecture discusses reversibility for Markov processes and for tandem M/M/1 queues. Random walks and their applications are then introduced.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: