Related papers: Some Remarks on Non-Planar Diagrams
The symmetry factor of Feynman diagrams for real and complex scalar fields is presented. Being analysis of Wick expansion for Green functions, the mentioned factor is derived in a general form. The symmetry factor can be separated into two…
This paper looks at the task of network topology inference, where the goal is to learn an unknown graph from nodal observations. One of the novelties of the approach put forth is the consideration of prior information about the density of…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the…
A convenient measure of a map or flow's chaotic action is the topological entropy. In many cases, the entropy has a homological origin: it is forced by the topology of the space. For example, in simple toral maps, the topological entropy is…
We identify incompressible planar linear flows that are generalizations of the well known one-parameter family characterized by the ratio of in-plane extension to (out-of-plane) vorticity. The latter `canonical' family is classified into…
We develop a new formalism to study nonlinear evolution in the growth of large-scale structure, by following the dynamics of gravitational clustering as it builds up in time. This approach is conveniently represented by Feynman diagrams…
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…
Modeling distributions on Riemannian manifolds is a crucial component in understanding non-Euclidean data that arises, e.g., in physics and geology. The budding approaches in this space are limited by representational and computational…
A criterion for the existence of a plane model with two non-smooth Galois points for algebraic curves is presented, which is a generalization of Fukasawa's criterion for two smooth Galois points. Owing to this generalized criterion,…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
Probabilistic graphical models (PGMs) are tools for solving complex probabilistic relationships. However, suboptimal PGM structures are primarily used in practice. This dissertation presents three contributions to the PGM literature. The…
We investigate graph hypersurfaces and study conditions under which graph hypersurfaces admit algebraic torus operations. This leads in principle to a computation of graph motives using the theorem of Bialynicki-Birula, provided one knows…
We aim to connect the non commutative geometry ``quotient space'' viewpoint with the standard super Yang Mills theory approach in the spirit of Connes-Douglas-Schwartz and Douglas-Hull description of application of noncommutative geometry…
Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider…
An asymptotic expansion of the two-loop two-point ``master'' diagram with two masses $m$ and $M$, on the mass shell $Q^2=M^2$, is presented. The treatment of the non-analytical terms arising in the expansion around the branching point is…
We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…
A $k$-inner planar graph is a planar graph that has a plane drawing with at most $k$ {internal vertices}, i.e., vertices that do not lie on the boundary of the outer face of its drawing. An outerplanar graph is a $0$-inner planar graph. In…
The diagrammatic coaction underpins the analytic structure of Feynman integrals, their cuts and the differential equations they admit. The coaction maps any diagram into a tensor product of its pinches and cuts. These correspond…
Given a `genus' function $g=g(n)$, we let $\mathcal{E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in a surface of Euler genus at most $g(n)$. Let the random graph $R_n$…