Related papers: On (Anti)Conditional Independence in Dempster-Shaf…

A graph is well-covered if all its maximal independent sets are of the same cardinality (Plummer, 1970). If G is a well-covered graph, has at least two vertices, and G-v is well-covered for every vertex v, then G is a 1-well-covered graph…

We study $\mathcal{N}=2$ theories on four-dimensional manifolds that admit a Killing vector $v$ with isolated fixed points. It is possible to deform these theories by coupling position-dependent background fields to the flavor current…

A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…

An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…

We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…

In this article we formulate and prove the main theorems of the theory of character sheaves on unipotent groups over an algebraically closed field of characteristic p>0. In particular, we show that every admissible pair for such a group G…

This work investigates the intersection property of conditional independence. It states that for random variables $A,B,C$ and $X$ we have that $X$ independent of $A$ given $B,C$ and $X$ independent of $B$ given $A,C$ implies $X$ independent…

We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it $p$-robust random graph. It means that every edge is present with probability at least $p$, regardless…

Let $F(x)=(f_1(x), \dots, f_m(x))$ be such that $1, f_1, \dots, f_m$ are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, Oliveira and Vallentin in combination with estimating certain oscillatory…

This paper is concerned with test of the conditional independence. We first establish an equivalence between the conditional independence and the mutual independence. Based on the equivalence, we propose an index to measure the conditional…

Selfadhesivity is a property of entropic polymatroids which guarantees that the polymatroid can be glued to an identical copy of itself along arbitrary restrictions such that the two pieces are independent given the common restriction. We…

Stochastic independence has a complex status in probability theory. It is not part of the definition of a probability measure, but it is nonetheless an essential property for the mathematical development of this theory. Bayesian decision…

Ultrahigh-dimensional variable selection plays an increasingly important role in contemporary scientific discoveries and statistical research. Among others, Fan and Lv [J. R. Stat. Soc. Ser. B Stat. Methodol. 70 (2008) 849-911] propose an…

Two-dimensional squarefree monomial ideals can be seen as the Stanley-Reisner ideals of graphs. The main results of this paper are combinatorial characterizations for the Cohen-Macaulayness of ordinary and symbolic powers of such an ideal…

Within the derivative expansion of conformally reduced gravity, the modified split Ward identities are shown to be compatible with the flow equations if and only if either the anomalous dimension vanishes or the cutoff profile is chosen to…

We formulate necessary and sufficient conditions for an arbitrary discrete probability distribution to factor according to an undirected graphical model, or a log-linear model, or other more general exponential models. For decomposable…

In this paper, we study the independence polynomial $P_G(x)$ of a finite simple graph $G$, with emphasis on the evaluation at $x=-1$, symmetry, and its connection with the $h$-polynomial of the edge ideal of $G$. For big star graphs, we…

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

This paper examines the relationship between Shafer's belief functions and convex sets of probability distributions. Kyburg's (1986) result showed that belief function models form a subset of the class of closed convex probability…