Related papers: Summing One-Loop Graphs at Multi-Particle Threshol…
We present a formalism for the calculation of multi-particle one-loop amplitudes, valid for an arbitrary number N of external legs, and for massive as well as massless particles. A new method for the tensor reduction is suggested which…
We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…
Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics are based on triangles, such as those measuring social…
We discuss the threshold tree amplitudes in diverse nonintegrable quantum field theories in the framework of integrability. The amplitudes are related to some Baker functions defined on the auxiliary spectral curves and the nullification…
We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…
We investigate N=4 noncommutative super Yang-Mills (SYM) theory. We compute the one-loop four gauge boson scattering amplitude on parallel Dp-branes, and find the corresponding contribution to the noncommutative SYM one-loop action in a…
The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…
The 1-loop effective potential in a scalar theory with quartic interaction on the space $M^{4} \times T^{n}$ for $n=2$ is calculated and is shown to be unbounded from below. This is an indication of a possible instability of the vacuum of…
Propagation of particles with emission of arbitrary number of identical bosons all being at rest is considered. It is shown that in certain models the tree-level amplitudes for production of $n$ scalar bosons by two incoming particles are…
We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled…
We show how to compute the coefficients of the double box basis integrals in a massless four-point amplitude in terms of tree amplitudes. We show how to choose suitable multidimensional contours for performing the required cuts, and derive…
This paper investigates asymptotic properties of multifractal products of random fields. The obtained limit theorems provide sufficient conditions for the convergence of cumulative fields in the spaces $L_q.$ New results on the rate of…
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
Let $S_{p,n}$ denote the sample covariance matrix based on $n$ independent identically distributed $p$-dimensional random vectors in the null-case. The main result of this paper is an explicit expansion of trace moments and power-trace…
Recently it has been argued that tree-level scattering amplitudes in N=4 Yang-Mills theory are uniquely determined by a careful study of their superconformal and Yangian symmetries. However, at one-loop order these symmetries are known to…
It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity with n. The spectral measure for random graphs G(n, c/n)…
We initiate a systematic study of amplitudes with massive external particles on the Coulomb-branch of N=4 super Yang Mills theory: 1) We propose that (multi-)soft-scalar limits of massless amplitudes at the origin of moduli space can be…
Let $G=(V,E)$ be a loopless graph and $\mathcal{T}(G)$ be the set of all spanning trees of $G$. Let $L(G)$ be the line graph of the graph $G$ and $t(L(G))$ be the number of spanning trees of $L(G)$. Then, by using techniques from electrical…
By the Gottesman-Knill Theorem, the outcome probabilities of Clifford circuits can be computed efficiently. We present an alternative proof of this result for quopit Clifford circuits (i.e., Clifford circuits on collections of $p$-level…
We give a simple prescription for computing, in the framework of the bosonic string theory, off-shell one-loop amplitudes with any number of external massless particles, both for the open and for the closed string. We discuss their…