A square matrix is diagonally dominant if the magnitude of its diagonal entries are greater than or equal to the sum of the magnitudes of all other entries in that row. There are two types of diagonal dominance, weak and strict, depending on whether a weak or strict inequality is used.

This course investigates the mathematical principles behind data and information analysis. It brings together concepts from statistics, optimization, and computer science, with a focus on large deviation inequalities, and convex analysis. It's tailored towards advanced graduate students who wish to incorporate these theories into their research.