Related papers: Webs in multiparton scattering using the replica t…
This is a general introduction to electric-magnetic duality in non-abelian gauge theories. In chapter I, I review the general ideas which led in the late 70s to the idea of electric/magnetic duality in quantum field theory. In chapters II…
Regarding the analysis of Web communication, social and complex networks the fast finding of most influential nodes in a network graph constitutes an important research problem. We use two indices of the influence of those nodes, namely,…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…
Are biological networks different from other large complex networks? Both large biological and non-biological networks exhibit power-law graphs (number of nodes with degree k, N(k) ~ k-b) yet the exponents, b, fall into different ranges.…
We formulate a new class of tensor gauge field theories in any dimension that is a hybrid class between symmetric higher-rank tensor gauge theory (i.e., higher-spin gauge theory) and anti-symmetric tensor topological field theory. Our…
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 consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model. We adopt a graphon as our random graph model, which is…
The interaction of the partonic fluctuation of the virtual photon in deep inelastic scattering with soft color fields describing the hadron is treated in an eikonal approximation. It is known that, in this approach, the small-x limit of the…
The note introduces a novel concept of non-Abelian patchworking arising as real locus of non-Abelian complex-phase tropical hypersurfaces, the theory of which is now developed enough to allow the proposed spin-off. Although, non-Abelian…
In position space the interaction terms of soft-collinear effective theory must be multipole-expanded to obtain interaction terms with homogeneous scaling behaviour. In this note we provide a manifestly gauge-invariant formulation of the…
Combinatorial optimizations are usually complex and inefficient, which limits their applications in large-scale networks with billions of links. We introduce a distributed computational method for solving a node-covering problem at the…
We present a geometric construction of a lattice that emulates the action of a gauge field on a fermion. The construction consists of a square lattice made of polymeric sites, where all clustered atoms are identical and represented by…
The study of probabilistic models for the analysis of complex networks represents a flourishing research field. Among the former, Exponential Random Graphs (ERGs) have gained increasing attention over the years. So far, only linear ERGs…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
We study novel three-dimensional gapped quantum phases of matter which support quasiparticles with restricted mobility, including immobile "fracton" excitations. So far, most existing fracton models may be instructively viewed as…
Construction of representations of braid group generators from $N$-state vertex models provide an elegant route to study knot and link invariants. Using such a braid group representation, an algebraic formula for the link invariants was put…
Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on…
Given a simple algebraic group $G$, a web is a directed trivalent graph with edges labelled by dominant minuscule weights. There is a natural surjection of webs onto the invariant space of tensor products of minuscule representations.…
A graph can be regarded as an electrical network in which each edge is a resistor. This point of view relates combinatorial quantities, such as the number of spanning trees, to electrical ones such as effective resistance. The second and…