相关论文: A Feynman-graph generator for any order of couplin…
Defeasible reasoning is the mode of reasoning where conclusions can be overturned by taking into account new evidence. A commonly used method in cognitive science and logic literature is to handcraft argumentation supporting inference…
Three programs are presented for automatically generating and calculating Feynman diagrams: the diagrams are generated with FeynArts, algebraically simplified with FormCalc, and finally evaluated numerically using the LoopTools package. The…
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…
Machine learning systems typically apply the same model to both easy and tough cases. This is in stark contrast with humans, who tend to evoke either fast (instinctive) or slow (analytical) thinking depending on the problem difficulty, a…
Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…
Structure aware graph generation aims to generate graphs that satisfy given topological properties. It has applications in domains such as drug discovery, social network modeling, and knowledge graph construction. Unlike existing methods…
Graphs are topological spaces that include broader objects than discretized manifolds, making them interesting playgrounds for the study of quantum phases not realized by symmetry breaking. In particular they are known to support anyons of…
A method to efficiently compute, in a automatic way, helicity amplitudes for arbitrary scattering processes at leading order in the Standard Model is presented. The scattering amplitude is evaluated recursively through a set of…
Massive power-law graphs drive many fields: metagenomics, brain mapping, Internet-of-things, cybersecurity, and sparse machine learning. The development of novel algorithms and systems to process these data requires the design, generation,…
In the wake of the growing popularity of machine learning in particle physics, this work finds a new application of geometric deep learning on Feynman diagrams to make accurate and fast matrix element predictions with the potential to be…
Partition- and moment functions for a general (not necessarily Gaussian) functional measure that is perturbed by a Gibbs factor are calculated using generalized Feynman graphs. From the graphical calculus, a new notion of Wick ordering…
The program MadGraph is presented which automatically generates postscript Feynman diagrams and Fortran code to calculate arbitrary tree level helicity amplitudes by calling HELAS[1] subroutines. The program is written in Fortran and is…
The algorithm to calculate the generating function for the number of ``skeleton'' diagrams for the irreducible self-energy and vertex parts is derived for the problems with Gaussian random fields. We find an exact recurrence relation…
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…
Using dispersive techniques, it is possible to avoid ultraviolet divergences in the calculation of Feynman diagrams, making subsequent regularization of divergent diagrams unnecessary. We give a simple introduction to the most important…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
In theories like SM or MSSM with a complex gauge group structure the complete set of Feynman diagrams contributed to a particular physics process can be splited to exact gauge invariant subsets. Arguments and examples given in the review…
We present an entanglement generation scheme which allows arbitrary graph states to be efficiently created in a linear quantum register via an auxiliary entangling bus. The dynamics of the entangling bus is described by an effective…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We describe the explicit construction of groves, the smallest gauge invariant classes of tree Feynman diagrams in gauge theories. The construction is valid for gauge theories with any number of group factors which may be mixed. It requires…