Previous Conferences & Workshops

In first passage percolation, we place i.i.d. non-negative weights on the nearest-neighbor edges of Z^d and study the induced random metric. A long-standing conjecture gives a relation between two "scaling exponents": one describes the variance of...

The notion of exactly (or approximately) representing certain combinatorial properties of a graph $G$ on a simpler graph is ubiquitous in combinatorial optimization. In this talk, I will introduce the notion of vertex sparsification. Here we are...

I will describe the notions of strong and weak epsilon nets in range spaces, and explain briefly some of their many applications in Discrete Geometry and Combinatorics, focusing on several recent results in the investigation of the extremal...

A long-standing line of work in economic theory has studied models by which a group of people in a social network, each holding a numerical opinion, can arrive at a shared opinion through repeated averaging with their neighbors in the network...