Related papers: Inductive Approach to Loop Vertex Expansion
Invariants are the predominant approach to verify the correctness of loops. As an alternative, loop contracts, which make explicit the premise and conclusion of the underlying induction proof, can sometimes capture correctness conditions…
We review the recent developments of the Loop-Tree Duality method, focussing our discussion on the first numerical implementation and its use in the direct numerical computation of multi-leg Feynman integrals. Non-trivial examples are…
The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing the Hasse diagram is given, and the rank generating function…
We compute the renormalized trajectory of $\phi^4_4$-theory by perturbation theory in a running coupling. We use an exact infinitesimal renormalization group. The expansion is put into a form which is manifestly independent of the scale…
A perturbative approach to quantum field theory involves the computation of loop integrals, as soon as one goes beyond the leading term in the perturbative expansion. First I review standard techniques for the computation of loop integrals.…
In this paper a new method for inverting the Laplace transform from the real axis is formulated. This method is based on a quadrature formula. We assume that the unknown function $f(t)$ is continuous with (known) compact support. An…
Networks and their higher order generalizations, such as hypernetworks or multiplex networks are ever more popular models in the applied sciences. However, methods developed for the study of their structural properties go little beyond the…
In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…
Despite recent advances in automating theorem proving in full first-order theories, inductive reasoning still poses a serious challenge to state-of-the-art theorem provers. The reason for that is that in first-order logic induction requires…
The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of…
We construct cumulants up to a finite order of a tensor field theory perturbed by a quartic term, nicknamed the $T_3^4$ model. The method we use is the multi-scale loop vertex expansion. We prove analyticity and Borel summability of the…
We develop a variational approximation to the entanglement entropy for scalar $\phi^4$ theory in 1+1, 2+1, and 3+1 dimensions, and then examine the entanglement entropy as a function of the coupling. We find that in 1+1 and 2+1 dimensions,…
We derive a new kind of recursion relation to obtain the one-particle-irreducible (1PI) Feynman diagrams for the effective action. By using this method, we have obtained the graphical representation of the four-loop effective action in case…
One-loop amplitudes may be expanded in a basis of scalar integrals multiplied by rational coefficients. We relate the coefficient of the one-point integral to the coefficients of higher-point integrals, by considering the effects of…
In theories with spontaneous symmetry breaking, the conventional effective potential possesses a defective loop expansion. For such theories, the exact effective potential $V(\phi_c,T)$ is real and convex, but its perturbative series is…
This paper introduces a new method for constructing approximate solutions to a class of Wiener--Hopf equations. This is particularly useful since exact solutions of this class of Wiener--Hopf equations, at the moment, cannot be obtained.…
An approximation method is presented for probabilistic inference with continuous random variables. These problems can arise in many practical problems, in particular where there are "second order" probabilities. The approximation, based on…
In the context of the Calculus of Variations for non-convex, vector variational problems, the natural process of going from a function $\phi$ to its quasiconvexification $Q\phi$ is quite involved, and, most of the time, an impossible task.…
Belief Propagation (BP) is one of the most popular methods for inference in probabilistic graphical models. BP is guaranteed to return the correct answer for tree structures, but can be incorrect or non-convergent for loopy graphical…
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…