相关论文: Graph calculus and the disconnected-boundary Schwi…
We treat random rank-$D$ tensor models as $D$-dimensional quantum field theories---tensor field theories (TFT)---and review some of their non-perturbative methods. We classify the correlation functions of complex tensor field theories by…
Group Field Theories (GFT) are quantum field theories over group manifolds; they can be seen as a generalization of matrix models. GFT Feynman graphs are tensor graphs generalizing ribbon graphs (or combinatorial maps); these graphs are…
We analyse the correlation functions of $\mathrm{U}(N)$-tensor models (or complex tensor models), which turn out to be classified by boundary graphs, and use the Ward-Takahashi identity and the graph calculus developed in [Commun. Math.…
Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
Lattice gauge theories of permutation groups with a simple topological action (henceforth permutation-TFTs) have recently found several applications in the combinatorics of quantum field theories (QFTs). They have been used to solve…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
Matrix field theory is a combinatorially non-local field theory which has recently been found to be a non-trivial but solvable QFT example. To generalize such non-perturbative structures to other models, a more combinatorial understanding…
In conformal field theory (CFT) on simply connected domains of the Riemann sphere, the natural conformal symmetries under self-maps are extended, in a certain way, to local symmetries under general conformal maps, and this is at the basis…
Recently, hetero-functional graph theory (HFGT) has developed as a means to mathematically model the structure of large-scale complex flexible engineering systems. It does so by fusing concepts from network science and model-based systems…
We discuss factorization of the Dyson--Schwinger equations using the Lie- and Hopf algebra of graphs. The structure of those equations allows to introduce a commutative associative product on 1PI graphs. In scalar field theories, this…
Random tensor models for a generic complex tensor generalize matrix models in arbitrary dimensions and yield a theory of random geometries. They support a 1/N expansion dominated by graphs of spherical topology. Their Schwinger Dyson…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Recently, a class of interaction round the face (IRF) solvable lattice models were introduced, based on any rational conformal field theory (RCFT). We investigate here the connection between the general solvable IRF models and the fusion…
It has been understood that correlation functions of multi-trace operators in ${\cal N}=4$ SYM can be neatly computed using the group algebra of symmetric groups or walled Brauer algebras. On the other hand such algebras have been known to…
In part III is realized the consistent development of Heisenberg--Dyson's two-layer matrix approximation to the graph formalism for postulating discrete physical objects (DPO) introduced in parts I-II in the form of discrete sets of…
Topological field theories (TFTs) play an important role in characterizing the deep infrared (IR) of many quantum systems with a mass gap, as well as the global symmetries of quantum field theories (QFTs) decoupled from gravity. In…
We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either \emph{safe} or \emph{unsafe} and we assume that failures only affect unsafe edges. In Unweighted…
Using functional derivatives with respect to the free correlation function we derive a closed set of Schwinger-Dyson equations in phi^4-theory. Its conversion to graphical recursion relations allows us to systematically generate all…
A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repeated structure when…