Course11110590160 lectures
Applied Stochastic Processes
Prof. Swanand Ravindra Khare Prof. Amitalok Jayant Budkuley · IIT Kharagpur
Lectures
Week 1
- Lecture 01 : Introduction to Probability
- Lecture 02 : Conditional Probability
- Lecture 03 : Total Probability and Bayes’ Rule
- Lecture 04 : Random Variables (Discrete)
- Lecture 05 : Discrete Random Variables & Special Distributions
Week 2
- Lecture 6 : Continuous Random Variables
- Lecture 7 : Expectation, Variance and Joint Distributions
- Lecture 8 : Conditional pmfs and pdfs, Independence
- Lecture 9 : Conditional Expectation and Conditional Variance
- Lecture 10 : Functions of random variable, sampling, limit theorems
Week 3
- Lecture 11 : Introduction to Stochastic Processes, Hitting Time
- Lecture 12 : Markov Chains
- Lecture 13 : Chapman–Kolmogorov Equations
- Lecture 14 : Classification of States
- Lecture 15 : Limiting and Stationary Distributions
Week 4
- Lecture 16 : Existence and Uniqueness of Stationary Distributions
- Lecture 17 : Positive and Null Recurrence
- Lecture 18 : Computation of Stationary Distribution and Gambler's Ruin
- Lecture 19 : Mean Time in Transient States and Branching Processes
- Lecture 20 : Hidden Markov Models
Week 5
- Lecture 21 : Introduction to counting processes and Bernoulli random processes
- Lecture 22 : Foundations of discrete-time Bernoulli random processes
- Lecture 23 : Bernoulli random processes: Alternate synthesis approaches
- Lecture 24 : Counting function of Bernoulli random processes
- Lecture 25 : Operations on Bernoulli random processes, and summary
Week 6
- Lecture 26 : Foundations of continuous-time Poisson random processes
- Lecture 27 : Poisson counting processes: Dynamical system approach, counting function
- Lecture 28 : Bernoulli approximation of Poisson processes, Key properties and illustrations via counting functions of Poisson counting processes
- Lecture 29 : Operations on Poisson counting processes, Illustrative examples
- Lecture 30 : Illustrative examples involving Poisson counting processes, summary, and comparison of Bernoulli and Poisson counting processes.
Week 7
- Lecture 31 : Continuous-time Markov Chains (CTMCs): Introduction
- Lecture 32 : CTMCs Foundations 1: Formal definitions of important quantities associated with CTMCs
- Lecture 33 : CTMCs Foundations 2: Transition rates, Generator, Embedded chains
- Lecture 34 : CTMCs via a sequence of DTMCs
- Lecture 35 : Birth-Death CTMCs: Foundations
Week 8
- Lecture 36 : Birth-Death CTMCs: Illustrations
- Lecture 37 : CTMCs: A re-look using first principles approach (I)
- Lecture 38 : CTMCs: A re-look using first principles approach (II)
- Lecture 39 : Transient analysis of CTMCs
- Lecture 40 : Steady state analysis of CTMCs, Reversibility, birth-death chains and reversibility
Week 9
- Lecture 41 : Renewal process: Foundations, examples, applications
- Lecture 42 : Counting function of Renewal processes
- Lecture 43 : Renewal function and Elementary renewal theorem
- Lecture 44 : CLT for Renewal processes, Renewal reward theorem, Illustration via age of renewal
- Lecture 45 : Renewal process: Illustrations and extensions
Week 10
- Lecture 46 : Queuing theory: Foundations, applications, Illustrative example via timing diagram
- Lecture 47 : Discrete-time Queues: Geo/Geo/1 queues
- Lecture 48 : Continuous-time Queues: M/M/* queues
- Lecture 49 : Delay models and delay analysis in Queueing theory
- Lecture 50 : Queueing Theory: General queues, Burke's theorem, Tandem queues, examples
Week 11
- Lecture 51 : Introduction to Brownian Motion and Random Walks
- Lecture 52 : Properties and Joint Distributions of Brownian Motion
- Lecture 53 : White Noise and Stochastic Integrals
- Lecture 54 : Gaussian Processes and Brownian Bridge
- Lecture 55 : Stationary Processes and Random Telegraph Signal
Week 12
Syllabus and materials
At NPTEL, as the course publishes them.
Credits and licence
- Institution
- IIT Kharagpur
- Department
- Mathematics
- Teacher
- Prof. Swanand Ravindra Khare Prof. Amitalok Jayant Budkuley
- Level
- Undergraduate
- Language
- English
- Subjects
- Mathematics
- Source
- NPTEL
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- NPTEL gives no rating. Invisible Network shows it to Teens profiles and older, judged from what the source says about it. How courses are placed
More like this
NPTEL111105098
Course
Introductory Course in Real Analysis
73 lectures · Source's player
NPTEL111105112
Course
Introduction to Abstract and Linear Algebra
40 lectures · Source's player
NPTEL111105121
Course
Engineering Mathematics - I
60 lectures · Source's player
NPTEL111105160
Course
Advanced Calculus for Engineers
60 lectures · Source's player
NPTEL111105161
Course
Rings and Modules
60 lectures · Source's player
NPTEL111105489
Course
Mathematics for Machine Learning
60 lectures · Source's player
NPTEL111105522
Course
Advanced Theory of Ordinary Differential Equations
60 lectures · Source's player
NPTEL111105035
Course
Advanced Engineering Mathematics
42 lectures · Video
NPTEL111105037
Course
Functional Analysis
40 lectures · Video
NPTEL111105038
Course
Numerical methods of Ordinary and Partial Differential Equations
40 lectures · Video
NPTEL111105039
Course
Optimization
40 lectures · Video
NPTEL111105041
Course
Probability and Statistics
40 lectures · Video