Login to filter by course Login to filter by course Reset
Introduces probability, statistics, distributions, inference, likelihood, and combinatorics for studying random events and network modeling.
Explores the Carpan collector problem, analyzing expected completion times and waiting times for collecting different objects uniformly at random.
Introduces combinatorics and counting methods for determining possible outcomes in various scenarios, illustrated with examples.
Introduces combinatorial group theory, emphasizing group presentations, normal subgroups, and group quotients.
Explores binomial coefficients, Pascal's triangle, binomial theorem, and object distribution among persons.
Explores the inclusion-exclusion formula in discrete mathematics, demonstrating its applications through examples and probability scenarios.
Covers the binomial theorem, Pascal's identity, and triangle with examples and applications.
Delves into applying the GAMP algorithm to simplify the lasso problem and analyze optimization challenges in neural networks.
Covers the combinatorics of the simplex category and its equivalence to topological spaces, as well as the concept of functor categories for cosimplicial and simplicial objects.
