Universality for random tensors and cycle graphs with multiple edges

Abstract

We consider the universality for the trace invariants of c1 N × ·s × cD N tensors with i.i.d. complex random elements. In the case c1 = ·s = cD, Gurau derived the universality in the limit N ∞ by representing the average trace invariants in terms of the corresponding colored graphs. Moreover he could explicitly calculate the asymptotic forms of the average trace invariants, if the corresponding graphs were special ones called "melonic graphs". In this paper we study another kind of special graphs, cycle graphs with multiple edges. One can construct these graphs by using simple cycle graphs and melonic graphs. Counting the number of the components, we can explicitly calculate the asymptotic forms of the average trace invariants.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…