Related papers: Rank axioms and supersimplicity
We consider the problem of testing mutual independence among the components of a high-dimensional random vector. Building on the rank-based max-sum framework, we introduce fixed finite-$L_q$ power-sum statistics under three general classes…
We consider change-point tests based on rank statistics to test for structural changes in long-range dependent observations. Under the hypothesis of stationary time series and under the assumption of a change with decreasing change-point…
The representation of independence relations generally builds upon the well-known semigraphoid axioms of independence. Recently, a representation has been proposed that captures a set of dominant statements of an independence relation from…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
Ranking entities such as algorithms, devices, methods, or models based on their performances, while accounting for application-specific preferences, is a challenge. To address this challenge, we establish the foundations of a universal…
We study ruled submanifolds of Euclidean space. First, to each (parametrized) ruled submanifold $\sigma$, we associate an integer-valued function, called degree, measuring the extent to which $\sigma$ fails to be cylindrical. In particular,…
We study Kim-independence over arbitrary sets. Assuming that forking satisfies existence, we establish Kim's lemma for Kim-dividing over arbitrary sets in an NSOP$_{1}$ theory. We deduce symmetry of Kim-independence and the independence…
In the setup of abstract elementary classes satisfying a local version of superstability, we prove the uniqueness property for $\mu$-forking, a certain independence notion arising from splitting. This had been a longstanding technical…
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
We write the partition function for a lattice gauge theory, with compact gauge group, exactly in terms of unconstrained variables and show that, in the mean field approximation, the dynamics of pure gauge theories, invariant under compact,…
In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…
We develop the theory of Kim-independence in the context of NSOP$_{1}$ theories satsifying the existence axiom. We show that, in such theories, Kim-independence is transitive and that $\ind^{K}$-Morley sequences witness Kim-dividing. As…
We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
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…
The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…
Based on the work done in \cite{BV-Tind,DMS} in the o-minimal and geometric settings, we study expansions of models of a supersimple theory with a new predicate distiguishing a set of forking-independent elements that is dense inside a…
In a recent paper, Bruhn, Diestel, Kriesell and Wollan (arXiv:1003.3919) present four systems of axioms for infinite matroids, in terms of independent sets, bases, closure and circuits. No system of rank axioms is given. We give an easy…
For an $\omega$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < \omega$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$…
Rankings are ubiquitous across many applications, from search engines to hiring committees. In practice, many rankings are derived from the output of predictors. However, when predictors trained for classification tasks have intrinsic…