Related papers: On (Anti)Conditional Independence in Dempster-Shaf…
Using the Batalin-Vilkovisky formalism, we study the Ward identities and the equations of gauge dependence in potentially anomalous general gauge theories, renormalizable or not. A crucial new term, absent in manifestly nonanomalous…
We show that every sheaf on the site of smooth manifolds with values in a stable (infinity,1)-category (like spectra or chain complexes) gives rise to a differential cohomology diagram and a homotopy formula, which are common features of…
Conditional independence and graphical models are well studied for probability distributions on product spaces. We propose a new notion of conditional independence for any measure $\Lambda$ on the punctured Euclidean space $\mathbb…
We establish a central limit theorem for the sum of $\epsilon$-independent random variables, extending both the classical and free probability setting. Central to our approach is the use of graphon limits to characterize the limiting…
The semigraphoid closure of every couple of CI-statements (GI=conditional independence) is a stochastic CI-model. As a consequence of this result it is shown that every probabilistically sound inference rule for CI-model, having at most two…
In this paper, we are concerned with the independence test for $k$ high-dimensional sub-vectors of a normal vector, with fixed positive integer $k$. A natural high-dimensional extension of the classical sample correlation matrix, namely…
In this article, we introduce fundamental notions and results about pullback formalisms, building on work of Drew-Gallauer. Our main application is producing a pullback formalism $\mathbf{SH}^{\mathrm{hol}}$ that encodes a version of…
An independent set in a graph $G$ is a set of pairwise non-adjacent vertices. A tree decomposition of $G$ is a pair $(T, \chi)$ where $T$ is a tree and $\chi : V(T) \rightarrow 2^{V(G)}$ is a function satisfying the following two axioms:…
Given a Bayesian network structure (directed acyclic graph), the celebrated d-separation algorithm efficiently determines whether the network structure implies a given conditional independence relation. We show that this changes drastically…
It is shown that for 2D field theories only the first order coefficient of the gravitationally dressed RG $\beta$-function is scheme independent. This is valid even for matter theories with one dimensionless coupling, where the first two…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much…
The rules of d-separation provide a framework for deriving conditional independence facts from model structure. However, this theory only applies to simple directed graphical models. We introduce relational d-separation, a theory for…
A common problem in various applications is the additive decomposition of the output of a function with respect to its input variables. Functions with binary arguments can be axiomatically decomposed by the famous Shapley value. For the…
Generative models can be trained to emulate complex empirical data, but are they useful to make predictions in the context of previously unobserved environments? An intuitive idea to promote such extrapolation capabilities is to have the…
We discuss properties of distributions that are multivariate totally positive of order two (MTP2) related to conditional independence. In particular, we show that any independence model generated by an MTP2 distribution is a compositional…
The independence polynomial $I(G,x)$ of a finite graph $G$ is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether, given a fixed number of vertices and edges, there exists…
Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…
We offer a new formalism for global explanations of pairwise feature dependencies and interactions in supervised models. Building upon SHAP values and SHAP interaction values, our approach decomposes feature contributions into synergistic,…
A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…