Related papers: Kruskal's Tree Theorem for Acyclic Term Graphs
\emph{Bidirected graphs} (a sort of nonstandard graphs introduced by Edmonds and Johnson) provide a natural generalization to the notions of directed and undirected graphs. By a \emph{weakly (node- or edge-) acyclic} bidirected graph we…
We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification…
Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, R\'acz, and Rashtchian used combinatorial…
We prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma,…
Graph transformation is the rule-based modification of graphs, and is a discipline dating back to the 1970s. The declarative nature of graph rewriting rules comes at a cost. In general, to match the left-hand graph of a fixed rule within a…
Simplifying graphs is a very applicable problem in numerous domains, especially in computational geometry. Given a geometric graph and a threshold, the minimum-complexity graph simplification asks for computing an alternative graph of…
We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the…
We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…
We prove that the hairy graph complex with the extra differential is almost acyclic. This justifies the construction of hairy graph cohomology classes by the waterfall mechanism. The main idea used in the paper is a new differential,…
In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…
General graphs are difficult for learning due to their irregular structures. Existing works employ message passing along graph edges to extract local patterns using customized graph kernels, but few of them are effective for the integration…
We consider the task of estimating a high-dimensional directed acyclic graph, given observations from a linear structural equation model with arbitrary noise distribution. By exploiting properties of common random graphs, we develop a new…
Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v.$ For a…
A classical Tur\'an problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph $H$ as a subgraph. It is well-known that the chromatic number of $H$ is the graph parameter which…
Graph representation learning plays an important role in many graph mining applications, but learning embeddings of large-scale graphs remains a problem. Recent works try to improve scalability via graph summarization -- i.e., they learn…
We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We propose two spectral algorithms for partitioning nodes in directed graphs respectively with a cyclic and an acyclic pattern of connection between groups of nodes. Our methods are based on the computation of extremal eigenvalues of the…
In this paper, the properties of minimal trails in a directed acyclic graph that is restricted not to contain an active cycle are studied. We are motivated by an application of the results in the copula-based Bayesian Network model…