Diagrammatic proof of the large NN melonic dominance in the SYK model

preprint2018arXivOpen access

Abstract

A crucial result on the celebrated Sachdev-Ye-Kitaev model is that its large NN 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.