Related papers: Webs in multiparton scattering using the replica t…
We propose a general framework for modelling network data that is designed to describe aspects of non-exchangeable networks. Conditional on latent (unobserved) variables, the edges of the network are generated by their finite growth history…
There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied.…
Non-Abelian physics, originating from noncommutative sequences of operations, unveils novel topological degrees of freedom for advancing band theory and quantum computation. In photonics, significant efforts have been devoted to developing…
We present new soft theorems for photon, gluon, and graviton correlators at tree level in (Anti)-de Sitter space. The results are derived by applying conformal Ward identities to constrain the structure of Witten diagrams.
In this work, we introduce an anyon condensation web that interconnects a broad class of 2D fracton gauge theories with multipolar conservation laws at a microscopic level. We find that condensation of anyons triggers the emergence of…
In community detection, datasets often suffer a sampling bias for which nodes which would normally have a high affinity appear to have zero affinity. This happens for example when two affine users of a social network were not exposed to one…
Complex molecules and mesoscopic structures are naturally described by general networks of elementary building blocks and tight-binding is one of the simplest quantum model suitable for studying the physical properties arising from the…
The enhanced power graph of a group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if they belong to same cyclic subgroup. In this paper, we study distant properties and detour distant properties such as…
Efficient methods for describing non abelian charges in worldline approaches to QFT are useful to simplify calculations and address structural properties, as for example color/kinematics relations. Here we analyze in detail a method for…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…
We propose a novel model-reduction methodology for large-scale dynamic networks with tightly-connected components. First, the coherent groups are identified by a spectral clustering algorithm on the graph Laplacian matrix that models the…
Gaussian mixture block models are distributions over graphs that strive to model modern networks: to generate a graph from such a model, we associate each vertex $i$ with a latent feature vector $u_i \in \mathbb{R}^d$ sampled from a mixture…
A powerful tool for calculations in non-Abelian gauge theories is obtained by combining the background field gauge, the helicity basis and the color decomposition methods. It has reproduced the one-loop calculation of the five-gluon…
We construct and study cluster algebra structures in rings of invariants of the special linear group action on collections of three-dimensional vectors, covectors, and matrices. The construction uses Kuperberg's calculus of webs on marked…
We investigate the soft decomposition of tree-level gluon amplitudes with split-helicity configurations. First, we show how any split-helicity amplitude can be fully fixed from inverse soft limit using BCFW calculation. We show how the…
Webs are combinatorial diagrams used to encode homomorphisms between representations of Lie (super)algebras and related objects. This paper extends the theory of webs to the quantum group of type Q. We define a monoidal supercategory of…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…
We derive an all order resummation formula for the deeply virtual Compton scattering (DVCS) amplitude, which takes into account soft gluon exchanges in the non-singlet quark coefficient function. We identify the ladder diagrams responsible…
We consider soft gluon evolution at the amplitude level to expose the structure of colour reconnection from a perturbative point of view. Considering the cluster hadronization model and an universal Ansatz for the soft anomalous dimension…