Related papers: Independence in generic incidence structures

This thesis examines the correspondence between models of statistical physics and Feynman graphs of quantum field theories (QFTs) by a common property: integrability. We review integrable structures for periodic boundary conditions on both…

Tree properties are introduced by Shelah, and it is well-known that a theory has TP (the tree property) if and only if it has TP$_1$ or TP$_2$. In any simple theory (i.e., a theory not having TP), forking supplies a good independence notion…

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

We characterize thorn-independence in a variety of structures, focusing on the field of real numbers expanded by predicate defining a dense multiplicative subgroup, G, satisfying the Mann property and whose pth powers are of finite index in…

The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We…

A graph $G$ is {\it $n$-existentially closed} if, for all disjoint sets of vertices $A$ and $B$ with $|A\cup B|=n$, there is a vertex $z$ not in $A\cup B$ adjacent to each vertex of $A$ and to no vertex of $B$. In this paper, we investigate…

We prove that if a separable II$_1$ factor $M$ is existentially closed, then every $M$-bimodule is weakly contained in the trivial $M$-bimodule, $\text{L}^2(M)$, and, equivalently, every normal completely positive map on $M$ is a pointwise…

We give a category-theoretic construction of simple and NSOP$_1$-like independence relations in locally finitely presentable categories, and in the more general locally finitely multipresentable categories. We do so by identifying…

Log-linear models are a classical tool for the analysis of contingency tables. In particular, the subclass of graphical log-linear models provides a general framework for modelling conditional independences. However, with the exception of…

We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…

Our "long term and large scale" aim is to characterize the first order theories T (at least the countable ones) such that: for every ordinal alpha there lambda,M_1,M_2 such that M_1,M_2 are non-isomorphic models of T of cardinality lambda…

We analyse in a systematic way the occurrences of a remarkable structure in the theory of integrable probability that we call a ``max-independence structure'', when random variables are constructed as a maximum of a sequence of independent…

For $n\geq 3$, define $T_n$ to be the theory of the generic $K_n$-free graph, where $K_n$ is the complete graph on $n$ vertices. We prove a graph theoretic characterization of dividing in $T_n$, and use it to show that forking and dividing…

We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational…

We leverage an algorithm of Deming [R.W. Deming, Independence numbers of graphs -- an extension of the Koenig-Egervary theorem, Discrete Math., 27(1979), no. 1, 23--33; MR534950] to decompose a matchable graph into subgraphs with a precise…

The simplicial rook graph ${\rm \mathcal{SR}}(m,n)$ is the graph whose vertices are vectors in $ \mathbb{N}^m$ such that for each vector the summation of its coordinates is $n$ and two vertices are adjacent if their corresponding vectors…

We propose two model-free, permutation-based tests of independence between a pair of random variables. The tests can be applied to samples from any bivariate distribution: continuous, discrete or mixture of those, with light tails or heavy…

Domination of grids has been proved to be a demanding task and with the addition of independence it becomes more challenging. It is known that no grid with $m,n \geq 5$ has an efficient dominating set, also called perfect code, that is, an…

We exhibit a new application of two dimensional covering systems, examples of integer pairs $a,b$ for which $a^m-b^n$ has a prime divisor from some given finite set of primes, for every pair of integers $m,n\geq 0$. This leads us to…

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…