Diagrammatic proof of the large N melonic dominance in the SYK model
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.