Related papers: Characteristic Imsets for Cyclic Linear Causal Mod…
Originating from spectral graph theory, cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. Two vertices of an undirected graph with real edge weights are cospectral iff…
We represent the Ising model of statistical physics by normal factor graphs in the primal and in the dual domains. By analogy with Kirchhoff's voltage and current laws, we show that in the primal normal factor graphs, the dependency among…
We study the problem of experimental design for accurately identifying the causal graph structure of a simple structural causal model (SCM), where the underlying graph may include both cycles and bidirected edges induced by latent…
Given a nontrivial homogeneous ideal $I\subseteq k[x_1,x_2,\ldots,x_d]$, a problem of great recent interest has been the comparison of the $r$th ordinary power of $I$ and the $m$th symbolic power $I^{(m)}$. This comparison has been…
Graphical causal models are an important tool for knowledge discovery because they can represent both the causal relations between variables and the multivariate probability distributions over the data. Once learned, causal graphs can be…
We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…
Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the…
We develop the theory linking 'E-separation' in directed mixed graphs (DMGs) with conditional independence relations among coordinate processes in stochastic differential equations (SDEs), where causal relationships are determined by "which…
In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous…
Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…
Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the…
A digraph that represents reasonably a scheduling problem should be a directed acyclic graph. Here down we shall deal with special kind of graded $DAGs$ named $KoDAGs$. For their definition and first primary properties see $ [1]$, where…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{\cal O}$ associated to an orientation ${\cal O}$ of the edges of $G$, the toric ideal $P_{G_{\cal O}}$. In this paper we study those graphs with the property…
An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
A toric ideal is called robust if its universal Gr\"obner basis is a minimal set of generators, and is called generalized robust if its universal Gr\"obner basis equals its universal Markov basis (the union of all its minimal sets of…
In his pioneering paper on matroids in 1935, Whitney obtained a characterization for binary matroids and left a comment at end of the paper that the problem of characterizing graphic matroids is the same as that of characterizing matroids…
This paper proposes a simple procedure to decide whether the empirically-observed adjacency or weights matrix, which characterizes the graph underlying a socio-economic network, is sufficiently symmetric (respectively, asymmetric) to…