Related papers: Factorization of Spanning Trees on Feynman Graphs
Tree-level scattering amplitudes for a scalar particle coupled to an arbitrary number N of photons and a single graviton are computed. We employ the worldline formalism as the main tool to compute the irreducible part of the amplitude,…
We investigate the embedding formalism in conjunction with the Mellin transform to determine tree-level gluon amplitudes in AdS/CFT. Detailed computations of three to five-point correlators are conducted, ultimately distilling what were…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
Motivated by Schnabl's gauge choice, we explore open string perturbation theory in gauges where a linear combination of antighost oscillators annihilates the string field. We find that in these linear b-gauges different gauge conditions are…
Attached to both Yang-Mills and General Relativity about Minkowski spacetime are distinguished gauge independent objects known as the on-shell tree scattering amplitudes. We reinterpret and rigorously construct them as $L_\infty$ minimal…
Expectation propagation is a general approach to fast approximate inference for graphical models. The existing literature treats models separately when it comes to deriving and coding expectation propagation inference algorithms. This comes…
We show that for any $\varepsilon>0$ and $\Delta\in\mathbb{N}$, there exists $\alpha>0$ such that for sufficiently large $n$, every $n$-vertex graph $G$ satisfying that $\delta(G)\geq\varepsilon n$ and $e(X, Y)>0$ for every pair of disjoint…
After seeing how questions on the finer distribution of prime factorization -- considered inaccessible until recently -- reduce to bounding the norm of an operator defined on a graph describing factorization, we will show how to bound that…
We introduce a new class of higgs type complex-valued scalar fields $U$ with Feynman propagator $\sim 1/p^4$ and consider the matching to the traditional fields with propagator $\sim 1/p^2$ in the viewpoint of effective potentials at tree…
In this paper, the reduction of Feynman integrals in the parametric representation is considered. This method proves to be more efficient than the integration-by-part (IBP) method in the momentum space. Tensor integrals can directly be…
This thesis contains two parts. The first part deals with pion-nucleon/meson-baryon scattering in the Kadyshevsky formalism. This formalism is introduced and discussed. Problems may arise when derivative couplings and/or higher spin fields…
The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…
We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…
This paper makes two main contributions: The first is the construction of a near-minimum spanning tree with constant average distortion. The second is a general equivalence theorem relating two refined notions of distortion: scaling…
In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let $(X,Y)$ be the bipartition of the complete bipartite graph $K_{m,n}$ with…
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…
Conventional superstring perturbation theory based on the world-sheet approach gives divergent results for the S-matrix whenever the total center of mass energy of the incoming particles exceeds the threshold of production of any final…
Planar arrays of tree diagrams were introduced as a generalization of Feynman diagrams that enables the computation biadjoint amplitudes $m^{(k)}_n$ for $k>2$ . In this follow-up work we investigate the poles of $m^{(k)}_n$ from the…
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to…