EECE 7346 — Probabilistic System Modeling and Analysis

4 semester hoursGraduateLecturetypical days: TBostonTraditional

Covers fundamentals of probabilistic system modeling, building toward techniques that allow analyzing complex stochastic systems in a tractable fashion. Modeling large and complex systems requires reasoning about probabilistic behavior at a large scale. Reviews classic topics like Markov chains, convergence to a steady state, renewal processes, renewal reward processes, the strong law of large numbers, and the elementary renewal theorem. Additional topics include the asymptotic behavior of probabilistic systems, including stochastic approximation/Robbins-Monro type algorithms, and ODE/fluid limits. Illustrates how these modeling techniques can be applied in modeling real systems and adaptive algorithms, including queueing systems, distributed systems, and online learning algorithms like stochastic gradient descent.

Prerequisites

Offering history

TermSectionsEnrolledCapacityFullOpen seats/section
Spring 2025183027%22.0

Snapshots from scheduled scrapes — not live seat availability. "Full" can exceed 100% when sections over-enroll.

Meeting times

Share of recent sections by weekday: M 0% · T 100% · W 0% · Th 0% · F 0%

Common patterns: T (100% of sections) — in patterns, R means Thursday

Professors

Spring

Percentages are each professor's average share of the season's enrolled students in recent terms.

Unlocks

EECE 7215

Courses that list EECE 7346 in their prerequisites.

Links

Official catalog (EECE course descriptions) · Student reviews on RateMyHusky · All EECE courses · Plan it at numap.app