Video Lectures

We consider the totally asymmetric simple exclusion process with initial conditions and/or jump rates such that shocks are generated. If the initial condition is deterministic, then the shock at time t will have a width of order \(t^{1/3}\). We...

Edge reinforced random walk (ERRW) and vertex reinforced jump processes are history dependent stochastic process, where the particle tends to come back more often on sites it has already visited in the past. For a particular scheme of reinforcement...

Hirota relations in their various incarnations play an important role in both classical and quantum integrable systems, from matrix integrals and PDE's to one-dimensional quantum spin chains and two dimensional quantum field theories (QFT). The...

The goal of computationally sound symbolic security is to create formal systems of cryptography which have a sound interpretation with respect to complexity-based notions of security. While there has been much progress in the development of such...

We revisit the question, originally posed by Yao (1982), of whether encryption security may be characterized using computational information. Yao provided an affirmative answer, using a compression-based notion of computational information to give a...

We consider the problem of the list-decodability of error correcting codes. The well-known Johnson bound implies that any code with good distance has good list-decodability, but we do not know many structural conditions on a code which guarantee...

In this talk we will explain several results surrounding global stability problem for the Boltzmann equation 1872 with the physically important collision kernels derived by Maxwell 1867 for the full range of inverse power intermolecular potentials,...

In joint work with Ballard, Demmel, and Schwartz, we showed the communication cost of algorithms (also known as I/O-complexity) to be closely related to the small-set expansion properties of the corresponding computation graphs. This graph expansion...