相关论文: World Graph Formalism for Feynman Amplitudes

The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…

We summarize recent progress in applying the worldline formalism to the analytic calculation of one-loop N-point amplitudes. This string-inspired approach is well-adapted to avoiding some of the calculational inefficiencies of the standard…

This article introduces moduli spaces of coloured graphs on which Feynman amplitudes can be viewed as 'discrete' volume densities. The basic idea behind this construction is that these moduli spaces decompose into disjoint unions of open…

Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…

We present a generalized unitarity method for theories of point-particle worldlines coupled to gravity, analogous to that of scattering amplitudes in quantum field theory. This method allows the computation of perturbative observables from…

Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalise this approach by considering arbitrary, directed graphs…

We present a method to accelerate the numerical evaluation of spatial integrals of Feynman diagrams when expressed on the real frequency axis. This can be realized through use of a renormalized perturbation expansion with a constant but…

In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…

The proper time path integral representation is derived explicitly for an arbitrary $n$-point amplitude in QCD. In the standard perturbation theory the formalism allows to sum up the leading subseries, e.g. yielding double-logarithm Sudakov…

It is argued that quantum propagation of D-particles in the limit \alpha'-> 0 can represent the "joining-splitting" processes of Feynman graphs of a certain field theory in the light-cone frame. So basically it provides the possibility to…

We use mixed Hodge structures to investigate Feynman amplitudes as functions of external momenta and masses.

The present work continues the program of summing planar Feynman graphs on the world sheet. Although it is based on the same classical action introduced in the earlier work, there are important new features: Instead of the path integral…

In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…

Two programs for the computation of perturbative expansions of quantum field theory amplitudes are provided. feyngen can be used to generate Feynman graphs for Yang-Mills, QED and $\varphi^k$ theories. Using dedicated graph theoretic tools…

With the aid of simple examples we show how to make simple estimates of the sizes of higher-order Feynman graphs. Our methods enable appropriate values of renormalization and factorization scales to be made. They allow the diagnosis of the…

We develop the general formalism for performing perturbative diagrammatic expansions in the lattice theory of quantum gravity. The results help establish a precise correspondence between continuum and lattice quantities, and should be a…

We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

Recently, efforts have been made in the community to design new Graph Neural Networks (GNN), as limitations of Message Passing Neural Networks became more apparent. This led to the appearance of Graph Transformers using global graph…