How to resum Feynman graphs
From MaRDI portal
Abstract: 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 but the percentage of Hepp's sectors in which the tree is leading the ultraviolet analysis. We explain how they allow to reshuffle the divergent series formulated in terms of Feynman graphs into convergent series indexed by the trees that these graphs contain. The Feynman graphs to be used are not the ordinary ones but those of the intermediate field representation, and the result of the reshuffling is called the Loop Vertex Expansion.
Recommendations
Cites work
- Colored tensor models -- a review
- Constructive \(\phi^{4}\) field theory without tears
- Constructive field theory in zero dimension
- Constructive renormalization for \(\Phi^{4}_2\) theory with loop vertex expansion
- Constructive renormalization of the 2-dimensional Grosse-Wulkenhaar model
- Critical behavior of colored tensor models in the large N limit
- Divergence of perturbation theory for bosons
- Divergence of Perturbation Theory in Quantum Electrodynamics
- Explicit fermionic tree expansions
- scientific article; zbMATH DE number 3721546 (Why is no real title available?)
- scientific article; zbMATH DE number 1292255 (Why is no real title available?)
- scientific article; zbMATH DE number 778054 (Why is no real title available?)
- Loop vertex expansion for \(\phi^{2k}\) theory in zero dimension
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The \(1/N\) expansion of colored tensor models
- The \(1/N\) expansion of tensor models beyond perturbation theory
- The complete \(1/N\) expansion of colored tensor models in arbitrary dimension
- Topological graph polynomials and quantum field theory. I: Theory kernel theories
- Tree quantum field theory
- Universality for random tensors
Cited in
(31)- Explicit fermionic tree expansions
- Loop vertex expansion for higher-order interactions
- Note on the intermediate field representation of \(\phi^{2k}\) theory in zero dimension
- Constructive tensor field theory: the \(T_{4}^{4}\) model
- Intermediate field representation for positive matrix and tensor interactions
- Infinite lattice models by an expansion with a non-Gaussian initial approximation
- Constructive matrix theory for higher-order interaction
- Analyticity results for the cumulants in a random matrix model
- Constructive renormalization of the 2-dimensional Grosse-Wulkenhaar model
- The \(1/N\) expansion of tensor models beyond perturbation theory
- Constructive tensor field theory: the \({T^4_3}\) model
- Hepp's bound for Feynman graphs and matroids
- Constructive tensor field theory
- Constructive expansion for vector field theories I. Quartic models in low dimensions
- Constructive tensorial group field theory II: the ${U(1)-T^4_4}$ model
- Constructive tensorial group field theory. I: The \(\mathrm{U}(1)-T^4_3\) model
- The multiscale loop vertex expansion
- Convergent series for lattice models with polynomial interactions
- Inductive approach to loop vertex expansion
- Convergent series for polynomial lattice models with complex actions
- Corrected loop vertex expansion for _2⁴ theory
- Constructive field theory in zero dimension
- Honeycomb Hubbard model at van Hove filling
- Tree quantum field theory
- The small-N series in the zero-dimensional O(N) model: constructive expansions and transseries
- Loop vertex representation for cumulants, bounds on free energy with sources
- Variational loop vertex expansion
- Taming non-analyticities of QFT observables
- Large-N limit of O(N)^3-invariant general sextic tensor model
- Double scaling in tensor models with a quartic interaction
- Supersymmetric cluster expansions and applications to random Schrödinger operators
This page was built for publication: How to resum Feynman graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471116)
