Tuan Tran, Anti-concentration phenomena

Room B232 IBS (기초과학연구원)

Let $X$ be a real random variable; a typical anti-concentration inequality asserts that (under certain assumptions) if an interval $I$ has small length, then $\mathbb{P}(X\in I)$ is small, regardless the

Sebastian Siebertz, Rank-width meets stability


Forbidden graph characterizations provide a convenient way of specifying graph classes, which often exhibit a rich combinatorial and algorithmic theory. A prime example in graph theory are classes of bounded