Related papers: Graph Reconstruction, Functorial Feynman Rules and…
In [1, arXiv:1102.1844] the author disputes the conclusion of our paper [2, arXiv:1006.0714]. He claims that the Feynman graphs of three dimensional group field theory always represent pseudo manifolds. However, [1] uses a different…
The graph structure is a commonly used data storage mode, and it turns out that the low-dimensional embedded representation of nodes in the graph is extremely useful in various typical tasks, such as node classification, link prediction ,…
We give a coalgebra structure on 1-vertex irreducible graphs which is that of a cocommutative coassociative graded connected coalgebra. We generalize the coproduct to the algebraic representation of graphs so as to express a bare 1-particle…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of…
Inferring missing links or detecting spurious ones based on observed graphs, known as link prediction, is a long-standing challenge in graph data analysis. With the recent advances in deep learning, graph neural networks have been used for…
This article reports on some recent progresses in Bessel moments, which represent a class of Feynman diagrams in 2-dimensional quantum field theory. Many challenging mathematical problems on these Bessel moments have been formulated as a…
The Hanna Neumann conjecture states that if F is a free group, then for all nontrivial finitely generated subgroups H,K <= F, rank(H intersect K) - 1 <= [rank(H)-1] [rank(K)-1]. Where most papers to date have considered a direct graph…
We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
Extending tensor models at the field theoretical level, tensor field theories are nonlocal quantum field theories with Feynman graphs identified with simplicial complexes. They become relevant for addressing quantum topology and geometry in…
We prove an extension of the Furstenberg set theorem to families of graphs satisfying a transversality condition. We apply the result to derive bounds on $L^{p}$-norms of Fourier transforms of fractal measures supported on plane curves.
Probabilistic graphical models provide a powerful tool to describe complex statistical structure, with many real-world applications in science and engineering from controlling robotic arms to understanding neuronal computations. A major…
We investigate combinatorial and algebraic aspects of the interplay between renormalization and monodromies for Feynman amplitudes. We clarify how extraction of subgraphs from a Feynman graph interacts with putting edges onshell or with…
The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…
Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Forn{\ae}ss and Peters \cite{FP}. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties…
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…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
We solve the existence problem for $F$-designs for arbitrary $r$-uniform hypergraphs~$F$. This implies that given any $r$-uniform hypergraph~$F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of…
The Hopf algebra structure underlying Feynman diagrams which governs the process of renormalization in perturbative quantum field theory is reviewed. Recent progress is briefly summarized with an emphasis on further directions of research.