Related papers: Testability of relations between permutations
We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one…
Multiple testing of a single hypothesis and testing multiple hypotheses are usually done in terms of p-values. In this paper we replace p-values with their natural competitor, e-values, which are closely related to betting, Bayes factors,…
A family of permutations $A \subset S_n$ is said to be \emph{$t$-set-intersecting} if for any two permutations $\sigma, \pi \in A$, there exists a $t$-set $x$ whose image is the same under both permutations, i.e. $\sigma(x)=\pi(x)$. We…
We develop a monitoring procedure to detect changes in a large approximate factor model. Letting $r$ be the number of common factors, we base our statistics on the fact that the $\left( r+1\right) $-th eigenvalue of the sample covariance…
Understanding the metric structure of permutation families is fundamental to combinatorics and has applications in social choice theory, bioinformatics, and coding theory. We study permutation families defined by restriction…
Homological stability has shown itself to be a powerful tool for the computation of homology of families of groups such as general linear groups, mapping class groups or automorphisms of free groups. We survey here tools and techniques for…
Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures…
Mutation analysis evaluates test suites and testing techniques by measuring how well they detect seeded defects (mutants). Even though well established in research, mutation analysis is rarely used in practice due to scalability problems…
We present a general approach to constructing permutation tests that are both exact for the null hypothesis of equality of distributions and asymptotically correct for testing equality of parameters of distributions while allowing the…
This paper addresses the ubiquity of remarkable measures on graphs, and their applications. In many queueing systems, it is necessary to take into account the compatibility constraints between users, or between supply and demands, and so…
In this article, we present an automated approach that would test for and discover the interoperability of CAD systems based on the approximately-invariant shape properties of their models. We further show that exchanging models in standard…
We study the notion of permutation stability (or P-stability) for countable groups. Our main result provides a wide class of non-amenable product groups which are not P-stable. This class includes the product group $\Sigma\times\Lambda$,…
In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \preceq y$,…
A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let $S_n(\sigma_1, \sigma_2, \ldots, \sigma_r)$ be the set of permutations in the symmetric group $S_n$ which avoids…
Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…
In this paper, we consider the fundamental problem of testing for monotone trend in a time series. While the term "trend" is commonly used and has an intuitive meaning, it is first crucial to specify its exact meaning in a hypothesis…
Linear systems governed by continuous-time difference equations cover a wide class of linear systems. From the Lyapunov-Krasovskii approach, we investigate stability for such a class of systems. Sufficient conditions, and in some particular…
Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…
Let $V_1, V_2, V_3, \dots $ be a sequence of $\mathbb{Q}$-vector spaces where $V_n$ carries an action of $\mathfrak{S}_n$ for each $n$. {\em Representation stability} and {\em multiplicity stability} are two related notions of when the…
Popularity is an approach in mechanism design to find fair structures in a graph, based on the votes of the nodes. Popular matchings are the relaxation of stable matchings: given a graph G=(V,E) with strict preferences on the neighbors of…