Related papers: Random Feynman Graphs
Dyson has shown an equivalence between infinite-range Coulomb gas models and classical random matrix ensembles for the study of eigenvalue statistics. In this paper, we introduce finite-range Coulomb gas (FRCG) models as a generalization of…
A random graph of free groups contains a surface subgroup
Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when…
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
Work is reported on finite integral representations for 2-loop massive 2-, 3- and 4-point functions, using orthogonal and parallel space variables. It is shown that this can be utilized to cover particles with arbitrary spin (tensor…
We describe a general approach of determining the distribution of spanning subgraphs in the random graph $\G(n,p)$. In particular, we determine the distribution of spanning subgraphs of certain given degree sequences, which is a…
Random graph (RG) models play a central role in the complex networks analysis. They help to understand, control, and predict phenomena occurring, for instance, in social networks, biological networks, the Internet, etc. Despite a large…
To any graph with external half-edges and internal masses, we associate canonical integrals which depend non-trivially on particle masses and momenta, and are always finite. They are generalised Feynman integrals which satisfy graphical…
A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…
Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…
Group field theories are higher dimensional generalizations of matrix models. Their Feynman graphs are fat and in addition to vertices, edges and faces, they also contain higher dimensional cells, called bubbles. In this paper, we propose a…
The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it sequentially adds new random edges so that the degree of each…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…
A java-based graphical tool for drawing Feynman diagrams is presented. It differs from similar existing tools in various respects. For example, it is based on models, consisting of particles (lines) and (optionally) vertices, each of which…
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…
We consider the infinite family of Feynman graphs known as the "banana graphs" and compute explicitly the classes of the corresponding graph hypersurfaces in the Grothendieck ring of varieties as well as their Chern-Schwartz-MacPherson…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
We show that momentum space Feynman diagrams involving internal massless fields can be cast as conformal integrals. This leads to a classification of all Feynman diagrams into conformal families, labelled by conformal integrals. Computing…