Related papers: Mixtures of Discrete Decomposable Graphical Models
In this paper, we explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a $C_5$-free vertex decomposable graph $G$, $\T{reg}(R/I(G))= c_G$, where…
A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…
Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic component has maximum degree at most $d$. A…
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when the number $n$ of vertices is large. In particular we investigate which of these graphs yield the maximum numbers of independent sets of…
We present a probabilistic model for natural images which is based on Gaussian scale mixtures and a simple multiscale representation. In contrast to the dominant approach to modeling whole images focusing on Markov random fields, we…
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…
We classify all binomial edge ideals that are complete intersection and Cohen-Macaulay almost complete intersection. We also describe an algorithm and provide an implementation to compute primary decomposition of binomial edge ideals.
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
This monograph is about discrete energy minimization for discrete graphical models. It considers graphical models, or, more precisely, maximum a posteriori inference for graphical models, purely as a combinatorial optimization problem.…
In this article we give explicit descriptions of the multiplicities of some classes of monomial ideals. For instance, we give a formula for the multiplicities of all codimension 1 monomial ideals, and another formula for the multiplicities…
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses,…
In this paper, we study a subclass of the class of MD-algebras, i.e., the class of solvable real Lie algebras such that the K-orbits of its corresponding connected and simply connected Lie groups are either orbits of dimension zero or…
This paper propose a novel decomposable graphical model to accommodate skew Gaussian graphical models. We encode conditional independence structure among the components of the multivariate closed skew normal random vector by means of a…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs…
Cubic forms in three variables are parametrised by points of $\P^9$. We study the subvarieties in this space defined by decomposable forms. Specifically, we calculate the equivariant minimal resolutions of these varieties and describe their…