Related papers: Factorization of covariant Feynman graphs for the …
Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key quantity of interest is the mutual information between the…
Triangle Feynman diagrams can be considered as describing form factors of states bound by a zero-range interaction. These form factors are calculated for scalar particles and compared to point-form and non-relativistic results. By examining…
We construct the covariant effective field theory of gravity as an expansion in inverse powers of the Planck mass, identifying the leading and next-to-leading quantum corrections. We determine the form of the effective action for the cases…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
A factor-graph representation of quantum-mechanical probabilities (involving any number of measurements) is proposed. Unlike standard statistical models, the proposed representation uses auxiliary variables (state variables) that are not…
We present a general formalism for simplifying manipulations of spin indices of massless and massive spinors and vectors in Feynman diagrams. The formalism is based on covariantly reducing the number of field components in the action in…
We discuss the symmetry factors of Feynman diagrams of scalar field theories with polynomial potential. After giving a concise general formula for them, we present an elementary and direct proof that when computing scattering amplitudes…
At 2-loop order in the Coulomb gauge, individual Feynman graphs contributing to the effective action have energy divergences. It is proved that these cancel in suitable combinations of graphs. This has previously been shown only for…
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
This paper derives the Feynman rules for the diagrammatic perturbation expansion of the effective action around an arbitrary solvable problem. The perturbation expansion around a Gaussian theory is well known and composed of one-line…
We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…
We present a method for a recursive graphical construction of Feynman diagrams with their correct multiplicities in quantum electrodynamics. The method is first applied to find all diagrams contributing to the vacuum energy from which all…
In a way analogous to type IIB supergravity, we give a covariant action for the fermion field supplemented with a constraint which should be imposed on equations of motion, in Berkovits' open superstring field theory. From this action we…
In a recent paper \cite{ft} a new powerful method to calculate Feynman diagrams was proposed. It consists in setting up a Taylor series expansion in the external momenta squared. The Taylor coefficients are obtained from the original…
We start the paper with a brief presentation of the main characteristics of graphene, and of the Dirac theory of massless fermions in 2+1 dimensions obtained as the associated low-momentum effective theory, in the absence of external…
In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…