English
Related papers

Related papers: Testing Intersecting and Union-Closed Families

200 papers

We investigate a coupled system of elliptic equations of Lane--Emden--Fowler type on a bounded domain $\Omega \subset \mathbb{R}^n$ ($n \geq 1$) with homogeneous Dirichlet boundary conditions. The system is characterized by sublinear…

Analysis of PDEs · Mathematics 2026-02-24 Dragos-Patru Covei

In this paper, we study the stochastic probing problem under a general monotone norm objective. Given a ground set $U = [n]$, each element $i \in U$ has an independent nonnegative random variable $X_i$ with known distribution. Probing an…

Data Structures and Algorithms · Computer Science 2025-10-17 Jian Li , Yinchen Liu , Yiran Zhang

A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…

Combinatorics · Mathematics 2019-02-20 Tom Eccles

We initiate the study of property testing problems concerning relations between permutations. In such problems, the input is a tuple $(\sigma_1,\dotsc,\sigma_d)$ of permutations on $\{1,\dotsc,n\}$, and one wishes to determine whether this…

Data Structures and Algorithms · Computer Science 2024-07-11 Oren Becker , Alexander Lubotzky , Jonathan Mosheiff

This paper explores the connection between classical isoperimetric inequalities, their directed analogues, and monotonicity testing. We study the setting of real-valued functions $f : [0,1]^d \to \mathbb{R}$ on the solid unit cube, where…

Data Structures and Algorithms · Computer Science 2024-10-03 Renato Ferreira Pinto

Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the…

Information Theory · Computer Science 2014-12-09 Jayakrishnan Unnikrishnan

We study property testing in the \emph{random neighbor oracle} model for graphs, originally introduced by Czumaj and Sohler [STOC 2019]. Specifically, we initiate the study of characterizing the graph families that are $H$-\emph{testable}…

Data Structures and Algorithms · Computer Science 2025-11-25 Christine Awofeso , Patrick Greaves , Oded Lachish , Amit Levi , Felix Reidl

While coresets have been growing in terms of their application, barring few exceptions, they have mostly been limited to unsupervised settings. We consider supervised classification problems, and non-decomposable evaluation measures in such…

Machine Learning · Computer Science 2023-12-18 Jayesh Malaviya , Anirban Dasgupta , Rachit Chhaya

In another related work, U-statistics were used for non-asymptotic "average-case" analysis of random compressed sensing matrices. In this companion paper the same analytical tool is adopted differently - here we perform non-asymptotic…

Information Theory · Computer Science 2015-06-11 Fabian Lim , Vladimir Stojanovic

Quantifying the strength of functional dependence between random scalars $X$ and $Y$ is an important statistical problem. While many existing correlation coefficients excel in identifying linear or monotone functional dependence, they fall…

Methodology · Statistics 2024-03-27 Muhong Gao , Qizhai Li

We prove tight entropic uncertainty relations for a large number of mutually unbiased measurements. In particular, we show that a bound derived from the result by Maassen and Uffink for 2 such measurements can in fact be tight for up to…

Quantum Physics · Physics 2007-05-23 Manuel A. Ballester , Stephanie Wehner

We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset of volume at most $k$ has conductance at least $\phi$. Small set expansion has recently received significant…

Data Structures and Algorithms · Computer Science 2015-01-06 Angsheng Li , Pan Peng

We characterize the set of properties of Boolean-valued functions on a finite domain $\mathcal{X}$ that are testable with a constant number of samples. Specifically, we show that a property $\mathcal{P}$ is testable with a constant number…

Data Structures and Algorithms · Computer Science 2016-12-20 Eric Blais , Yuichi Yoshida

Given a family $\mathcal{F}\subset 2^{[n]}$ and $1\leq i\neq j\leq n$, we use $\mathcal{F}(\bar{i},j)$ to denote the family $\{F\setminus \{j\}\colon F\in \mathcal{F},\ F\cap \{i,j\}=\{j\}\}$. The sturdiness of $\mathcal{F}$ is defined as…

Combinatorics · Mathematics 2024-12-11 Peter Frankl , Jian Wang

It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The…

Combinatorics · Mathematics 2018-05-28 Vadim Lozin , Igor Razgon , Viktor Zamaraev , Elena Zamaraeva , Nikolai Yu. Zolotykh

We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set…

Data Structures and Algorithms · Computer Science 2016-12-13 Israela Solomon

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…

Dynamical Systems · Mathematics 2020-10-13 José M. Amigó , Angel Giménez

A copolymer is a chain of repetitive units (monomers) that are almost identical, but they differ in their degree of affinity for certain solvents. This difference leads to striking phenomena when the polymer fluctuates in a nonhomogeneous…

Probability · Mathematics 2010-11-11 Francesco Caravenna , Giambattista Giacomin

We develop a systematic, omnibus approach to goodness-of-fit testing for parametric distributional models when the variable of interest is only partially observed due to censoring and/or truncation. In many such designs, tests based on the…

Methodology · Statistics 2026-02-10 Juan Carlos Escanciano , Jacobo de Uña-Álvarez

This paper deals with unit root issues in time series analysis. It has been known for a long time that unit root tests may be flawed when a series although stationary has a root close to unity. That motivated recent papers dedicated to…

Statistics Theory · Mathematics 2024-06-04 Marie Badreau , Frédéric Proïa