Related papers: Random Models of Idempotent Linear Maltsev Conditi…
It is known that any finite idempotent algebra that satisfies a nontrivial Maltsev condition must satisfy the linear one-equality Maltsev condition (a variant of the term discovered by M. Siggers and refined by K. Kearnes, P. Markovi\'c,…
In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a fixed (strong) Maltsev condition $\Sigma$. Our goal in this paper is to show that $\Sigma$-testing can be accomplished…
The main result of this paper shows that if $\mathcal{M}$ is a consistent strong linear Maltsev condition which does not imply the existence of a cube term, then for any finite algebra $\mathbb{A}$ there exists a new finite algebra…
Markov categories have recently turned out to be a powerful high-level framework for probability and statistics. They accommodate purely categorical definitions of notions like conditional probability and almost sure equality, as well as…
We give a collection of explicit sufficient conditions for the true martingale property of a wide class of exponentials of semimartingales. We express the conditions in terms of semimartingale characteristics. This turns out to be very…
We consider deep multivariate models for heterogeneous collections of random variables. In the context of computer vision, such collections may e.g. consist of images, segmentations, image attributes, and latent variables. When developing…
In this article, we introduce the idempotentization process, which bears some philosophical and mathematical similarities with modern analytification and tropicalization. Idempotentization associates to any affine scheme an idempotent…
Matrix conditions extend linear Mal'tsev conditions from Universal Algebra to exactness properties in Category Theory. Some can be stated in the finitely complete context while, in general, they can only be stated for regular categories. We…
While hidden class models of various types arise in many statistical applications, it is often difficult to establish the identifiability of their parameters. Focusing on models in which there is some structure of independence of some of…
Let $S$ be an additively idempotent semiring and $\mathbf{M}_n(S)$ be the semiring of all $n\times n$ matrices over $S$. We characterize the conditions of when the semiring $\mathbf{M}_n(S)$ is congruence-simple provided that the semiring…
Conditional probabilities are a core concept in machine learning. For example, optimal prediction of a label $Y$ given an input $X$ corresponds to maximizing the conditional probability of $Y$ given $X$. A common approach to inference tasks…
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…
Conditional independence and Markov properties are powerful tools allowing expression of multidimensional probability distributions by means of low-dimensional ones. As multidimensional possibilistic models have been studied for several…
We study idempotents in intensional Martin-L\"of type theory, and in particular the question of when and whether they split. We show that in the presence of propositional truncation and Voevodsky's univalence axiom, there exist idempotents…
We derive equivalent conditions for the (local) absolute continuity of two laws of semimartingales on random sets. Our result generalizes previous results for classical semimartingales by replacing a strong uniqueness assumption by a weaker…
McFadden's random-utility model of multinomial choice has long been the workhorse of applied research. We establish shape-restrictions under which multinomial choice-probability functions can be rationalized via random-utility models with…
We obtain a necessary and sufficient condition under which random-coefficient discrete choice models, such as mixed-logit models, are rich enough to approximate any nonparametric random utility models arbitrarily well across choice sets.…
This is an introduction to the theory of one-dimensional disordered systems and products of random matrices, confined to the 2 by 2 case. The notion of impurity model--- that is, a system in which the interactions are highly localised---…
Spatial-temporal linear model and the corresponding likelihood-based statistical inference are important tools for the analysis of spatial-temporal lattice data. In this paper, we study the asymptotic properties of maximum likelihood…
Random matrices tend to be well conditioned, and we employ this well known property to advance matrix computations. We prove that our algorithms employing Gaussian random matrices are efficient, but in our tests the algorithms have…