Related papers: Multigraphs and Time Ordered Isserlis-Wick formula…
We give the first polynomial-time algorithms on graphs of bounded maximum induced matching width (mim-width) for problems that are not locally checkable. In particular, we give $n^{\mathcal{O}(w)}$-time algorithms on graphs of mim-width at…
We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1 \pm \varepsilon$. Our algorithm runs in time $\varepsilon^{-2} 4^k(n+m)…
In this article, we give two extended space formulations, respectively, for the induced tree and path polytopes of chordal graphs with vertex and edge variables. These formulations are obtained by proving that the induced tree and path…
A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number of labelled maps with a given degree sequence, sorted by…
We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
The observed output of an interferometer is the result of interference among the parts of the input light beam traveling along each possible optical path. In complex systems, writing down all these possible optical paths and computing their…
We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-directed edges, is a representation of conditional…
We prove several claims made by Kontsevich about the orbifold Euler characteristic of the three types of graph homology introduced by him. For this purpose, first we develop a simplified version of the Feynman diagram method, which requires…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
An automated treatment of iterated integrals based on letters induced by real-valued quadratic forms and Kummer--Poincar\'e letters is presented. These quantities emerge in analytic single and multi--scale Feynman diagram calculations. To…
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more…
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…
Geometric approaches to network analysis combine simply defined models with great descriptive power. In this work we provide a method for embedding directed acyclic graphs into Minkowski spacetime using Multidimensional scaling (MDS). First…
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…
We describe how to construct and compute unambiguously path integrals for particles moving in a curved space, and how these path integrals can be used to calculate Feynman graphs and effective actions for various quantum field theories with…
The Galilei-covariant fermionic field theories are quantized by using the path-integral method and five-dimensional Lorentz-like covariant expressions of non-relativistic field equations. Firstly, we review the five-dimensional approach to…
We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights…
Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set;…
The time derivative of the circulation of a vector field $\boldsymbol{A}$ over a moving and deforming closed curve, $\frac {\mathrm{d}}{\mathrm{d} t}\oint \boldsymbol{A} \cdot \mathrm{d} \boldsymbol{r}$, is computed in two ways, with and…
We point out that the total number of trails and the total number of paths of given length, between two vertices of a simple undirected graph, are obtained as expectation values of specifically engineered quantum mechanical observables.…