Related papers: Independence over arbitrary sets in NSOP$_1$ theor…
A recently proposed axiom system for Andr\'e's central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed…
We propose and axiomatize preferences on a product state space in light of uncertainty regarding the dependency of different payoff-relevant factors. Dependence structures allow to decompose probabilities and allow to pin down behavior…
In this article we study various forms of $\ell$-independence (including the case $\ell=p$) for the cohomology and fundamental groups of varieties over finite fields and equicharacteristic local fields. Our first result is a strong form of…
This paper shows that algebraic (in)dependence is encoded in Milnor K-theory of fields. As an application, we show that the isomorphism type of a field is determined by its Milnor K-theory, up to purely inseparable extensions, in most…
We show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary…
We generalize P. M. Neumann's Lemma to the setting of isometric actions on metric spaces and use it to prove several results in continuous logic related to algebraic independence. In particular, we show that algebraic independence satisfies…
We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…
We establish a generic result concerning order independence of a dominance relation on finite games. It allows us to draw conclusions about order independence of various dominance relations in a direct and simple way.
We introduce an atomic formula intuitively saying that given variables are independent from given other variables if a third set of variables is kept constant. We contrast this with dependence logic. We show that our independence atom gives…
We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent…
We prove the existence of a model companion of the two-sorted theory of $c$-nilpotent Lie algebras over a field satisfying a given theory of fields. We describe a language in which it admits relative quantifier elimination up to the field…
We develope the framework of transitional conditional independence. For this we introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and unify previous notions of…
We prove the Simons-Johnson theorem for the sums $S_n$ of $m$-dependent random variables, with exponential weights and limiting compound Poisson distribution $\CP(s,\lambda)$. More precisely, we give sufficient conditions for…
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…
Probabilistic independence is a useful concept for describing the result of random sampling---a basic operation in all probabilistic languages---and for reasoning about groups of random variables. Nevertheless, existing verification methods…
Testing mutual independence among multiple random variables is a fundamental problem in statistics, with wide applications in genomics, finance, and neuroscience. In this paper, we propose a new class of tests for high-dimensional mutual…
Given finite sets $X_1,\dotsc,X_m$ in $\mathbb{R}^d$ (with $d$ fixed), we prove that there are respective subsets $Y_1,\dotsc,Y_m$ with $|Y_i|\ge \frac{1}{\operatorname{poly}(m)}|X_i|$ such that, for $y_1\in Y_1,\dotsc,y_m\in Y_m$, the…
In this paper, we study multiplicative dependence of values of polynomials or rational functions over a number field. As an application, we obtain new results on multiplicative dependence in the orbits of a univariate polynomial dynamical…
We introduce an independence criterion based on entropy regularized optimal transport. Our criterion can be used to test for independence between two samples. We establish non-asymptotic bounds for our test statistic and study its…
We study stable like behaviour in first order theories without the independence property. We introduce generically stable measures, give characterizatiions, and show their ubiquity. We also introduce generic compact domination. We also…