Endre Csóka received his PhD Sampling and local algorithms in large graphs" from Eötvös Loránd University in Budapest, Hungary in 2013 where his supervisor was László Lovász.

Between 2017 and 2019, Csóka held an MSCA grant on Limit Theory in Combinatorics at the Rényi Institute. In 2021, he was one of the mathematicians who won an Élvonal grant on Random graphs and local algorithms.

As for the DYNASNET project, he studies analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences, respectively.