Related papers: On Multiple Gluon Exchange Webs
We define a grid presentation for singular links i.e. links with a finite number of rigid transverse double points. Then we use it to generalize link Floer homology to singular links. Besides the consistency of its definition, we prove that…
We review some recent ideas regarding classical topological objects in dual superconductor models that could represent different confining states of the gluon field. We also comment about natural components in (magnetic) ensembles that…
We establish exactly and uniquely the infrared structure of the full gluon propagator in QCD, not solving explicitly the corresponding dynamical equation of motion. By construction, this structure is an infinite sum over all possible severe…
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…
Equivariance to permutations and rigid motions is an important inductive bias for various 3D learning problems. Recently it has been shown that the equivariant Tensor Field Network architecture is universal -- it can approximate any…
Let $G$ be an infinite, connected, locally finite planar graph and consider i.i.d.\ Bernoulli$(p)$ site percolation. Write $p_c^{\mathrm{site}}(G)$ and $p_u^{\mathrm{site}}(G)$ for the critical and uniqueness thresholds. Using a…
Let each point of a homogeneous Poisson process in R^d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution mu on the positive integers. We consider translation-invariant schemes…
We consider approaches to the eikonal-like unitarization of elastic amplitude and its generalizations in theories where cross-sections grow with energy, and we discuss corresponding mechanisms of the multiple exchange standing behind it. In…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
We study the leading singularities for pure gluon amplitudes obtained by on-shell gluing of three-particle amplitudes for an arbitrary graph in any number of dimensions. By encoding the polarization vector contractions in a graphical way,…
For connected reductive linear algebraic structure groups it is proven that every web is holonomically isolated. The possible tuples of parallel transports in a web form a Lie subgroup of the corresponding power of the structure group. This…
Graph convolutional networks (GCNs) are a widely used method for graph representation learning. We investigate the power of GCNs, as a function of their number of layers, to distinguish between different random graph models on the basis of…
A graphon is a limiting object used to describe the behaviour of large networks through a function that captures the probability of edge formation between nodes. Although the merits of graphons to describe large and unlabelled networks are…
We present a survey of some aspects and new results on configurations, i.e. disjoint unions of constellations of infinitely near points, local and global theory, with some applications and results on generalized Enriques diagrams, singular…
In this talk I discuss the application and generalization of the antenna subtraction method to processes involving incoherent interferences of partial amplitudes, which are generically present for the sub-leading colour contributions to…
Some examples of translation invariant site percolation processes on the $\Z^2$ lattice are constructed, the most far-reaching example being one that satisfies uniform finite energy (meaning that the probability that a site is open given…
We give a simple quantum mechanical formulation of the eikonal propagation approximation, which has been heavily used in recent years in problems involving hadronic interactions at high energy. This provides a unified framework for several…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
Interactions between units in phyical, biological, technological, and social systems usually give rise to intrincate networks with non-trivial structure, which critically affects the dynamics and properties of the system. The focus of most…
Although theoretical properties such as expressive power and over-smoothing of graph neural networks (GNN) have been extensively studied recently, its convergence property is a relatively new direction. In this paper, we investigate the…