In this talk we will discuss about the role played by smooth Renyi quantities in non-asymptotic information theory. In particular, we will discuss about various source coding and channel coding problems in the non-asymptotic regime.
We analyze large random matching markets with unequal numbers of men and women. We find that being on the short side of the market confers a large advantage.
We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on deep results from combinatorial group theory. It applies both to regular and irregular random graphs.
A stylized model of one-dimensional stochastic root-finding involves repeatedly querying an oracle as to whether the root lies to the left or right of a given point $x$.
