Feynman graphs12/28/2023 ![]() We find that, on average, the amplitude of planar graphs is significantly larger than that of non-planar graphs, irrespective of O( N) symmetry. We confirm the strong correlation with the Hepp bound, the Martin invariant, and the number of 6-edge cuts. We examine the relation between the period and various properties of the underlying graphs. A small class of graphs, most notably the zigzags, grows significantly faster than the mean and causes the limiting distribution to have divergent moments even when normalized to unit mean. At high loop order, a limiting distribution is reached for the amplitudes near the mean. We confirm the leading asymptotic growth of the average period with growing loop order, up to a factor of 2. We examine the distribution of the numerically computed Feynman periods. All expected symmetries are respected by the numerical values of periods. Combining the symmetries, we discover relations between periods that had been overlooked earlier. We implement all known symmetries of the period in a new computer program and count them up to 14 loops. Our data set includes all primitive graphs up to 13 loops, and non-complete samples up to 18 loops, with an accuracy of ca. We numerically compute the periods of 1.3 million completed graphs, this represents more than 33 million graphs contributing to the beta function. ![]() The amplitude of subdivergence-free logarithmically divergent Feynman graphs in ϕ 4-theory in 4 spacetime dimensions is given by a single number, the Feynman period.
0 Comments
Leave a Reply.AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |