101010.pl is one of the many independent Mastodon servers you can use to participate in the fediverse.
101010.pl czyli najstarszy polski serwer Mastodon. Posiadamy wpisy do 2048 znaków.

Server stats:

526
active users

#feynmangraph

0 posts0 participants0 posts today

New theoretical #physics preprint arxiv.org/abs/2412.08617
We looked at the asymptotic growth rate of the beta function in #quantumFieldTheory , and the relative importance of subdivergence-free #Feynmangraph s. These graphs correspond to integrals, and the size of the graph is measured by its loop number, which also indicates how hard it is to solve the integral. State of the art computations in realistic theories are anywhere between 1 and 6 loops. The asymptotics of the perturbation series is known from instanton calculations. We now showed (in a model theory), that the leading asymptotics describes the true growth rate only for more than 25 loops, way beyond anything that can realistically be computed.

This is good news: It tells us that asymptotic instanton calculations provide non-trivial additional information that can not be trivially inferred from low-order perturbation theory.
In the plot, the red dots are numerical data points for the subdivergence-free graphs in phi^4 theory up to 18 loops, the green lines are the leading instanton asymptotics.

My article together with Kimia Shaban has appeared in JHEP today. We have examined the #statistics of #Feynmangraph s in #QFT , and how they can be exploited to efficiently compute #amplitudes at high loop order.
The article is open access, and the dataset is freely available from my website if you want to explore statistics and correlations yourself. Predicting the values of these Feynman integrals could also be interesting as a test case for #machinelearning
link.springer.com/article/10.1

SpringerLinkPredicting Feynman periods in ϕ4-theory - Journal of High Energy PhysicsWe present efficient data-driven approaches to predict the value of subdivergence-free Feynman integrals (Feynman periods) in ϕ4-theory from properties of the underlying Feynman graphs, based on a statistical examination of almost 2 million graphs. We find that the numbers of cuts and cycles determines the period to better than 2% relative accuracy. Hepp bound and Martin invariant allow for even more accurate predictions. In most cases, the period is a multi-linear function of the properties in question. Furthermore, we investigate the usefulness of machine-learning algorithms to predict the period. When sufficiently many properties of the graph are used, the period can be predicted with better than 0.05% relative accuracy.We use one of the constructed prediction models for weighted Monte-Carlo sampling of Feynman graphs, and compute the primitive contribution to the beta function of ϕ4-theory at L ∈ {13, … , 17} loops. Our results confirm the previously known numerical estimates of the primitive beta function and improve their accuracy. Compared to uniform random sampling of graphs, our new algorithm is 1000-times faster to reach a desired accuracy, or reaches 32-fold higher accuracy in fixed runtime.The dataset of all periods computed for this work, combined with a previous dataset, is made publicly available. Besides the physical application, it could serve as a benchmark for graph-based machine learning algorithms.

I recently discovered an excellent #math article by Krajewski and Martinetti that I had overlooked so far: arxiv.org/abs/0806.4309
Basically, renormalization of #Feynmangraph s in #qft is organized in terms of rooted trees, and so are solutions to differential equations, concatenation of differential operators, numerical integration schemes, and the Hopf algebra of power series. It is intuitively clear that all these things must be closely related, but I wasn't aware that there is this article where the relations are actually spelled out in detail. They also include a derivation of Wigner's semicircle law for Gaussian random matrices in the rooted-tree formalism, which is something I didn't think about at all. Learned another unexpected connection 😀 .

arXiv.orgWilsonian renormalization, differential equations and Hopf algebrasIn this paper, we present an algebraic formalism inspired by Butcher's B-series in numerical analysis and the Connes-Kreimer approach to perturbative renormalization. We first define power series of non linear operators and propose several applications, among which the perturbative solution of a fixed point equation using the non linear geometric series. Then, following Polchinski, we show how perturbative renormalization works for a non linear perturbation of a linear differential equation that governs the flow of effective actions. Then, we define a general Hopf algebra of Feynman diagrams adapted to iterations of background field effective action computations. As a simple combinatorial illustration, we show how these techniques can be used to recover the universality of the Tutte polynomial and its relation to the $q$-state Potts model. As a more sophisticated example, we use ordered diagrams with decorations and external structures to solve the Polchinski's exact renormalization group equation. Finally, we work out an analogous construction for the Schwinger-Dyson equations, which yields a bijection between planar $ϕ^{3}$ diagrams and a certain class of decorated rooted trees.

Here is a curious finding from our statistical analysis arxiv.org/abs/2403.16217 :
A #Feynmangraph is a graphical short hand notation for a complicated integral that computes the probability for scattering processes in #quantum field theory.
An electrical circuit can also be described as a graph. What happens if we interpret the Feynman graph as an #electrical network, where each edge is a 1 Ohm resistor? We can then compute the resistance between any pair of vertices and collect all these values in a "resistance matrix", as shown below. The average of all these resistances is called "Kirchhoff index". Now it turns out that this average resistance is correlated fairly strongly with the Feynman integral of that graph: A graph with large contribution to quantum scattering amplitudes on average also has a large electrical resistance. Isn't that a nice connection between two seemingly distinct branches of theoretical #physics ?

The #Feynmangraph s that contribute to scattering amplitudes in #quantum field theory come in all shapes and sizes. Can one guess how much their Feynman integral will contribute just from looking at them 🤔? It turns out one can! Let's consider subdivergence-free graphs at 12 loops. The pictures show the two largest and the two smallest contributors. All graphs have the same number of edges and vertices. The graphs that contribute strongly look "larger", and the small contributors look "more dense", but drawings are of course arbitrary. A closer examination shows that "symmetry", as measured by graph automorphisms, is not clearly related to the value of the Feynman integral.