Modern discrete probabilistic methods suitable for analyzing discrete structures of the type arising in number theory, graph theory, combinatorics, computer science, information theory and molecular sequence analysis. Prerequisite: Math MATH 151, Stats MATH 117 or equivalent level of probability knowledge.
4 units · Letter or Credit/No Credit · GER: WAY-FR
Modern discrete probabilistic methods suitable for analyzing discrete structures of the type arising in number theory, graph theory, combinatorics, computer science, information theory and molecular sequence analysis. Prerequisite: Math 151, Stats 117 or equivalent level of probability knowledge.
Offered in Winter 2026, Spring 2026 at Stanford University.