Related papers: Web worlds, web-colouring matrices, and web-mixing…
In this paper we present new results for the combinatorics of web diagrams and web worlds. These are discrete objects that arise in the physics of calculating scattering amplitudes in non-abelian gauge theories. Web-colouring and web-mixing…
The non-Abelian exponentiation theorem has recently been generalised to correlators of multiple Wilson line operators. The perturbative expansions of these correlators exponentiate in terms of sets of diagrams called webs, which together…
Webs are sets of Feynman diagrams that contribute to the exponents of scattering amplitudes, in the kinematic limit in which emitted radiation is soft. As such, they have a number of phenomenological and formal applications, and offer…
The correlators of Wilson-line operators in non-abelian gauge theories are known to exponentiate, and their logarithms can be organised in terms of the collections of Feynman diagrams called Cwebs. The colour factors that appear in the…
Patterns often appear in a variety of large, real-world networks, and interesting physical phenomena are often explained by network topology as in the case of the bow-tie structure of the World Wide Web, or the small world phenomenon in…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing…
Many real-world networks describe systems in which interactions decay with the distance between nodes. Examples include systems constrained in real space such as transportation and communication networks, as well as systems constrained in…
The understanding of the immense and intricate topological structure of the World Wide Web (WWW) is a major scientific and technological challenge. This has been tackled recently by characterizing the properties of its representative graphs…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…
Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…
Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are…
Network-based modeling of complex systems and data using the language of graphs has become an essential topic across a range of different disciplines. Arguably, this graph-based perspective derives its success from the relative simplicity…