Related papers: Mixtures of Discrete Decomposable Graphical Models
Standard Gaussian graphical models (GGMs) implicitly assume that the conditional independence among variables is common to all observations in the sample. However, in practice, observations are usually collected form heterogeneous…
The shedding vertices of simplicial complexes are studied from an algebraic point of view. Based on this perspective, we introduce the class of ass-decomposable monomial ideals which is a generalization of the class of Stanley-Reisner…
We characterize the variety of compatible fundamental matrix triples by computing its multidegree and multihomogeneous vanishing ideal. This answers the first interesting case of a question recently posed by Br{\aa}telund and Rydell. Our…
The aim of this work is to study the v-number of edge ideals of clutters and graphs. We relate the v-number with the regularity of edge ideals and study the combinatorial structure of the graphs whose edge ideals have their second symbolic…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the concept of a vertex splittable ideal and show that a simplicial complex $\Delta$ is vertex decomposable if and only if $I_{\Delta^{\vee}}$…
Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…
We propose a novel measure for template matching named Deformable Diversity Similarity -- based on the diversity of feature matches between a target image window and the template. We rely on both local appearance and geometric information…
We give a new combinatorial characterization of the big height of a squarefree monomial ideal leading to a new bound for the projective dimension of a monomial ideal.
We study the family of ideals defined by mixed size minors of two-sided ladders of indeterminates. We compute their Groebner bases with respect to a skew-diagonal monomial order, then we use them to compute the height of the ideals. We show…
The paper presents a subclass of the class of MD5-algebras and MD5-groups, i.e. five dimensional solvable Lie algebras and Lie groups such that their orbits in the co-adjoint representation (K-orbits) are orbits of zero or maximal…
For a joint probability density function f(x) of a random vector X the mixed partial derivatives of log f(x) can be interpreted as limiting cumulants in an infinitesimally small open neighborhood around x. Moreover, setting them to zero…
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
This paper studies the combinatorics of ideals which recently appeared in ergodicity results for analytic equivalence relations. The ideals have the following topological representation. There is a separable metrizable space $X$, a…
We study algebraic varieties associated with the camera resectioning problem. We characterize these resectioning varieties' multigraded vanishing ideals using Gr\"obner basis techniques. As an application, we derive and re-interpret…
We consider the ideal of inner $2$-minors $I_{\mathcal{P}}$ of a finite set of cells $\mathcal{P}$, which we call the cell ideal of $\mathcal{P}$. A nice interpretation for the height of an unmixed ideal $I_{\mathcal{P}}$, in terms of the…
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…
In this article we use the modular decomposition technique for exact solving the weighted maximum clique problem. Our algorithm takes the modular decomposition tree from the paper of Tedder et. al. and finds solution recursively. Also, we…
We continue the study of the rich family of norm-closed, automorphism invariant ideals of a continuous nest algebra. First we present a unified framework which captures all stable ideals as the kernels of limits of diagonal compressions. We…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…