Related papers: Random Feynman Graphs
We introduce the regularized integrals for decorated graphs on elliptic curves, which produces an almost holomorphic function on upper half plane. Then we give the graph version of holomorphic anomaly equation to study the anti-holomorphic…
The problem of aligning Erd\"os-R\'enyi random graphs is a noisy, average-case version of the graph isomorphism problem, in which a pair of correlated random graphs is observed through a random permutation of their vertices. We study a…
The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…
We consider Catalan-pair graphs, a family of graphs that can be viewed as representing certain interactions between pairs of objects which are enumerated by the Catalan numbers. In this paper we study random Catalan-pair graphs and deduce…
I describe a mathematical framework for the efficient processing of the very large sets of Feynman diagrams contributing to the scattering of many particles. I reexpress the established numerical methods for the recursive construction of…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
We study a variant of the standard random intersection graph model ($G(n,m,F,H)$) in which random weights are assigned to both vertex types in the bipartite structure. Under certain assumptions on the distributions of these weights, the…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
We give a presentation of Feynman categories from a representation--theoretical viewpoint. Feynman categories are a special type of monoidal categories and their representations are monoidal functors. They can be viewed as a far reaching…
We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…
We construct a very general family of characteristic functions describing Random Matrix Ensembles (RME) having a global unitary invariance, and containing an arbitrary, one-variable probability measure which we characterize by a `spread…
Tensor models and, more generally, group field theories are candidates for higher-dimensional quantum gravity, just as matrix models are in the 2d setting. With the recent advent of a 1/N-expansion for coloured tensor models, more focus has…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
We prove a neat factorization property of Feynman graphs in covariant perturbation theory. The contribution of the graph to the effective action is written as a product of a massless scalar momentum integral that only depends on the basic…
Feynman integrals obey linear relations governed by intersection numbers, which act as scalar products between vector spaces. We present a general algorithm for constructing multivariate intersection numbers relevant to Feynman integrals,…
We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent $\tau\in(2,3)$. We also analyze the local clustering coefficient $c(k)$, the probability that two…
In this paper, we study the problem of partitioning a graph into connected and colored components called blocks. Using bivariate generating functions and combinatorial techniques, we determine the expected number of blocks when the vertices…
Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…