Related papers: Feynman Diagrams and Rooted Maps
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…
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…
In fields ranging from business to systems biology, directed graphs with edges labeled by signs are used to model systems in a simple way: the nodes represent entities of some sort, and an edge indicates that one entity directly affects…
There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While…
This note concerns a one-line diagrammatic proof of the Cayley-Hamilton Theorem. We discuss the proof's implications regarding the "core truth" of the theorem, and provide a generalization. We review the notation of trace diagrams and…
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…
In this thesis we develop the cohomology of diagrams of algebras and then apply this to the cases of the $\lambda$-rings and the $\Psi$-rings. A diagram of algebras is a functor from a small category to some category of algebras. For an…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
Consider a finite, regular cover $Y\to X$ of finite graphs, with associated deck group $G$. We relate the topology of the cover to the structure of $H_1(Y;\mathbb{C})$ as a $G$-representation. A central object in this study is the {\em…
The worldline formalism shares with string theory the property that it allows one to write down master integrals that effectively combine the contributions of many Feynman diagrams. While at the one-loop level these diagrams differ only by…
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…
Biomolecular networks have already found great utility in characterizing complex biological systems arising from pair-wise interactions amongst biomolecules. Here, we review how graph theoretical approaches can be applied not only for a…
The aim of this paper is to apply the framework, which was developed by Sam and Snowden, to study structural properties of graph homologies, in the spirit of Ramos, Miyata and Proudfoot. Our main results concern the magnitude homology of…
A connection between one-loop $N$-point Feynman diagrams and certain geometrical quantities in non-Euclidean geometry is discussed. A geometrical way to calculate the corresponding Feynman integrals is considered. (This paper contains a…
Unveiling hidden symmetries within Feynman diagrams is crucial for achieving more efficient computations in high-energy physics. In this paper, we study the symmetries underlying the causal Loop-Tree Duality (LTD) representations through a…
A derivation is given of the Feynman rules to be used in the perturbative computation of the Green's functions of a generic quantum many-body theory when the action which is being perturbed is not necessarily quadratic. Some applications…
We investigate the Yang-Lee edge singularity on non-planar random graphs, which we consider as the Feynman Diagrams of various d=0 field theories, in order to determine the value of the edge exponent. We consider the hard dimer model on…
This article gives a short step-by-step introduction to the representation of parametric Feynman integrals in scalar perturbative quantum field theory as periods of motives. The application of motivic Galois theory to the algebro-geometric…
Our purpose is to explore, in the context of loop ensembles on finite graphs, the relations between combinatorial group theory, loops topology, loop measures, and signatures of discrete paths. We determine the distributions of the loop…