Discrete Random Structures

3 credits · Undergraduate

This course covers basics of probability and stochastic processes, and then focuses on areas where probability and combinatorics interact. Topics include: probabilistic method, stochastic graph models for complex networks, probabilistic algorithms. Probabilistic techniques include: expectation and concentration of random variables, stochastic processes, conditional expectation, Markov chains, martingales, branching processes. PREREQUISITES: MATH 2110.03 or MATH 2113.03 or STAT 3360.03 CROSSLISTED: MATH 5340.03 FORMATS: Lecture