Diagrammatic proof of the large $N$ melonic dominance in the SYK model
Résumé
A crucial result on the celebrated Sachdev–Ye–Kitaev model is that its large N limit is dominated by melonic graphs. In this letter, we offer a rigorous, diagrammatic proof of that result by direct, combinatorial analysis of its Feynman graphs.