Related papers: Weighted graphs and complex Gaussian free fields
We provide a recursive diagrammatic prescription for the exponentiation of gauge theory amplitudes involving products of Wilson lines and loops. This construction generalizes the concept of webs, originally developed for eikonal form…
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 develop a procedure for re-summing the large logarithms induced in gravity by loops of inflationary scalars. We first show how the scalar can be integrated out of the field equations in the presence of constant graviton field. We then…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
We prove a complexity dichotomy theorem for symmetric complex-weighted Boolean #CSP when the constraint graph of the input must be planar. The problems that are #P-hard over general graphs but tractable over planar graphs are precisely…
We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability…
We propose a possible relation between complex networks and gravity. Our guide in our proposal is the power-law distribution of the node degree in network theory and the information approach to gravity. The established bridge may allow us…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…
We study discrete complex analysis and potential theory on a large family of planar graphs, the so-called isoradial ones. Along with discrete analogues of several classical results, we prove uniform convergence of discrete harmonic…
We study the optimal sample complexity of learning a Gaussian directed acyclic graph (DAG) from observational data. Our main results establish the minimax optimal sample complexity for learning the structure of a linear Gaussian DAG model…
We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.
The free energy of a multi-component scalar field theory is considered as a functional W[G,J] of the free correlation function G and an external current J. It obeys non-linear functional differential equations which are turned into…
Let $\Phi(x,y)$ be a bivariate polynomial with complex coefficients. The zeroes of $\Phi(x,y)$ are given a combinatorial structure by considering them as arcs of a directed graph $G(\Phi)$. This paper studies some relationship between the…
We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We…
Since the work of Lawler and Werner on "loop soups", these ensembles have also been the object of many investigations. Their properties can be studied in the context of rather general Markov processes, in particular Markov chains on graphs.…
We study the higher-derivative equations for gauge potentials of arbitrary mixed-symmetry type obtained by setting to zero the divergences of the corresponding curvature tensors. We show that they propagate the same reducible multiplets as…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we use the method developed before to solve one more special case. We make extensive use of standard…
A specific choice of gauge is shown to imply a decoupling between the tensor and scalar components of Gravitational Radiation in the context of Brans-Dicke type theories of gravitation. The comparison of the predictions of these theories…
We study the complexity of the following related computational tasks concerning a fixed countable graph G: 1. Does a countable graph H provided as input have a(n induced) subgraph isomorphic to G? 2. Given a countable graph H that has a(n…