A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma

Abstract

We introduce a correspondence principle (analogous to the Furstenberg correspondence principle) that allows one to extract an infinite random graph or hypergraph from a sequence of increasingly large deterministic graphs or hypergraphs. As an application we present a new (infinitary) proof of the hypergraph removal lemma of Nagle-Schacht-Rödl-Skokan and Gowers, which does not require the hypergraph regularity lemma and requires significantly less computation. This in turn gives new proofs of several corollaries of the hypergraph removal lemma, such as Szemerédi's theorem on arithmetic progressions.