Szemerédi’s Regularity Lemma: A partitioning result that decomposes large graphs into a bounded number of random-like subgraphs. Graph Limit Theory and Random Structures Publication Trend.

Alon, on the other hand, was banking on the fact that random graphs often display all sorts of optimal properties. He thought that these extremely good expanders would be common — that if you randomly ...

If the curve in the log graph is shown in regular linear scale, it looks like this: Clearly, the OxyContin levels peak quickly, but then they decline quickly as well.