Related papers: Summing One-Loop Graphs at Multi-Particle Threshol…
Parameters in an effective field theory can be subject to certain positivity bounds if one requires a UV completion that obeys the fundamental principles of quantum field theory. These bounds are relatively straightforward at the tree…
I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it…
We derive a duality relation between one-loop integrals and phase-space integrals emerging from them through single cuts. The duality relation is realized by a modification of the customary +i0 prescription of the Feynman propagators. The…
We analyze the one-loop effective gauge-field action in $Z_2$-orbifold compactifications of type-I theory. We show how, for non-abelian group factors, the threshold effects are ultraviolet finite though given entirely by a six-dimensional…
We present a new method for the numerical evaluation of loop integrals which is based on the Feynman Tree Theorem. The loop integrals are replaced by phase-space integration over fictitious extra on-shell particles. This integration can be…
We propose a new approach that allows for the separate numerical calculation of the real and imaginary parts of finite loop integrals. We find that at one-loop the real part is given by the Loop-Tree Duality integral supplemented with…
We address a system of weakly interacting particles where the heterogenous connections among the particles are described by a graph sequence and the number of particles grows to infinity. Our results extend the existing law of large numbers…
In this review, we discuss recent developments concerning efficient calculations of multi-loop multi-leg scattering amplitudes. Inspired by the remarkable properties of the Loop-Tree Duality (LTD), we explain how to reconstruct an integrand…
We use on-shell methods to calculate tree-level effective field theory (EFT) amplitudes, with no reference to the EFT operators. Lorentz symmetry, unitarity and Bose statistics determine the allowed kinematical structures. As a by-product,…
Supersymmetric Grand Unified Theories have a rich spectrum of particles barely heavier than the intermediate vector bosons. As their non-supersymmetric counterparts, they lead to many relations among low energy observables. But the precise…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s.…
By applying the known expressions for SYM and SUGRA tree amplitudes, we write generating functions for the NNMHV box coefficients of SYM as well as the MHV, NMHV, and NNMHV box coefficients for SUGRA. The all-multiplicity generating…
Extending work of Foster, Doyle, and others, we show how the Foster Theorems, a family of results concerning effective resistances on finite graphs, can in certain cases be extended to infinite graphs. A family of sum rules is then…
We show that the forward limit of tree-level scattering equations with two massive particles yields the SL(2,C)-covariant form of the one-loop scattering equations recently proposed by Geyer et al. We clarify several properties about these…
We compute the number of circuits and of loops with multiple crossings in random regular graphs. We discuss the importance of this issue for the validity of the cavity approach. On the one side we obtain analytic results for the infinite…
As soon as Lyman or Balmer lines overlap, the net absorption cross section rapidly approaches the value at the series limit. Independent of the difficult question of the relative contributions of line and continuous opacity, we can get a…