Study of structures and concepts that do not require the notion of continuity. Graph theory, or study of general countable sets are some of the areas that are covered by discrete mathematics. Emphasis will be laid on structures that the students will see a ...
We learn how to control the nonasymptotic and random behavior of collections of estimators, when indexed by classes of functions/sets. Examples range from prototypical estimators used by statisticians, to nonparametric models used in machine learning. ...
The 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that if the object is chosen at random, then it has the desir ...
This is an introductory course to the concentration of measure phenomenon - random functions that depend on many random variables tend to be often close to constant functions. ...
Study of structures and concepts that do not require the notion of continuity. Graph theory, or study of general countable sets are some of the areas that are covered by discrete mathematics. Emphasis will be laid on structures that the students will see a ...