English
Related papers

Related papers: Strongly Sublinear Algorithms for Testing Pattern …

200 papers

This paper examines the problem of testing whether a discrete time-series vector contains a periodic signal or is merely noise. To do this we examine the stochastic behaviour of the maximum intensity of the observed time-series vector and…

Computation · Statistics 2021-09-14 Ben O'Neill

In this paper we initiate the study of real operator monotonicity for functions of tuples of operators, which are multivariate structured maps with a functional calculus called free functions that preserve the order between real parts (or…

Functional Analysis · Mathematics 2019-12-19 Marcell Gaál , Miklós Pálfia

Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a…

Information Theory · Computer Science 2016-11-17 Michael B. Baer

A function $f: \mathbb{F}_2^n \rightarrow \{0,1\}$ is triangle-free if there are no $x_1,x_2,x_3 \in \mathbb{F}_2^n$ satisfying $x_1+x_2+x_3=0$ and $f(x_1)=f(x_2)=f(x_3)=1$. In testing triangle-freeness, the goal is to distinguish with high…

Data Structures and Algorithms · Computer Science 2014-11-19 Ishay Haviv , Ning Xie

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

Classical Analysis and ODEs · Mathematics 2016-06-27 R. M. Trigub

There exist a number of tests for assessing the nonparametric heteroscedastic location-scale assumption. Here we consider a goodness-of-fit test for the more general hypothesis of the validity of this model under a parametric functional…

Statistics Theory · Mathematics 2020-01-01 Marie Hušková , Simos G. Meintanis , Charl Pretorius

We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix $A \in [0,1]^{m \times n}$, a vector $b \in [1,\infty)^m$, and a monotone…

Data Structures and Algorithms · Computer Science 2012-05-01 Yossi Azar , Iftah Gamzu

We propose a test of many zero parameter restrictions in a high dimensional linear iid regression model with $k$ $>>$ $n$ regressors. The test statistic is formed by estimating key parameters one at a time based on many low dimension…

Statistics Theory · Mathematics 2023-12-12 Jonathan B. Hill

In this paper, we study the asymptotic behaviour of the v-number of a Noetherian graded filtration $\mathcal{I}= \{I_{[k]}\}_{k\geq 0}$ of a Noetherian $\mathbb{N}$-graded domain $R$. Recently, it is shown that $\mathrm{v}(I_{[k]})$ is…

Commutative Algebra · Mathematics 2024-04-30 Manohar Kumar , Ramakrishna Nanduri , Kamalesh Saha

We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function…

Computational Complexity · Computer Science 2014-02-05 Peter Franek , Marek Krcal

We prove a highly uniform version of the prime number theorem for a certain class of $L$-functions. The range of $x$ depends polynomially on the analytic conductor, and the error term is expressed in terms of an optimization problem…

Number Theory · Mathematics 2025-03-18 Ikuya Kaneko , Jesse Thorner

Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…

Discrete Mathematics · Computer Science 2024-11-15 Yiqiao Bao , Sampath Kannan , Erik Waingarten

We study the problem of testing whether a matrix $\mathbf{A} \in \mathbb{R}^{n \times n}$ with bounded entries ($\|\mathbf{A}\|_\infty \leq 1$) is positive semi-definite (PSD), or $\epsilon$-far in Euclidean distance from the PSD cone,…

Data Structures and Algorithms · Computer Science 2020-09-21 Ainesh Bakshi , Nadiia Chepurko , Rajesh Jayaram

We address the correspondence-free alignment of two rotation sets on \(SO(3)\), a core task in calibration and registration that is often impeded by missing time alignment, outliers, and unknown axis conventions. Our key idea is to…

Robotics · Computer Science 2025-12-02 Anik Sarker , Alan T. Asbeck

We study quantum algorithms for verifying properties of the output probability distribution of a classical or quantum circuit, given access to the source code that generates the distribution. We consider the basic task of uniformity…

Quantum Physics · Physics 2024-11-08 Clément L. Canonne , Robin Kothari , Ryan O'Donnell

For a permutation $\pi$ the major index of $\pi$ is the sum of all indices $i$ such that $\pi_i > \pi_{i+1}$. It is well known that the major index is equidistributed with the number of inversions over all permutations of length $n$. In…

Combinatorics · Mathematics 2015-05-28 Michal Opler

We give a non-adaptive algorithm that makes $2^{\tilde{O}(\sqrt{k\log(1/\varepsilon_2 - \varepsilon_1)})}$ queries to a Boolean function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$ and distinguishes between $f$ being $\varepsilon_1$-close to some…

Data Structures and Algorithms · Computer Science 2024-04-23 Shivam Nadimpalli , Shyamal Patel

The problem of testing changes in covariance has received increasing attention in recent years, especially in the context of high-dimensional testing. A number of approaches have been proposed, all limited to the two-sample problem and…

Methodology · Statistics 2016-09-06 Yi-Hui Zhou

We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…

Combinatorics · Mathematics 2020-12-29 David Marchant

We study the Stochastic Boolean Function Certification (SBFC) problem, where we are given $n$ Bernoulli random variables $\{X_e: e \in U\}$ on a ground set $U$ of $n$ elements with joint distribution $p$, a Boolean function $f: 2^U \to \{0,…

Data Structures and Algorithms · Computer Science 2026-04-06 Rohan Ghuge , Jai Moondra , Mohit Singh
‹ Prev 1 8 9 10 Next ›