Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays

DOI10.4230/LIPICS.ICALP.2017.9zbMATH Open1441.68280arXiv1607.03961OpenAlexW2962795283MaRDI QIDQ5111338FDOQ5111338

Daniel Reichman, Omri Ben-Eliezer, Simon Korman

Publication date: 27 May 2020

Abstract: Understanding the local behaviour of structured multi-dimensional data is a fundamental problem in various areas of computer science. As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically property testers, to understand local properties of the data. We focus on the natural local problem of testing pattern freeness: given a large $d$-dimensional array $A$ and a fixed $d$-dimensional pattern $P$ over a finite alphabet, we say that $A$ is $P$-free if it does not contain a copy of the forbidden pattern $P$ as a consecutive subarray. The distance of $A$ to $P$-freeness is the fraction of entries of $A$ that need to be modified to make it $P$-free. For any $epsilonin[0,1]$ and any large enough pattern $P$ over any alphabet, other than a very small set of exceptional patterns, we design a tolerant tester that distinguishes between the case that the distance is at least $epsilon$ and the case that it is at most $a_{d}epsilon$, with query complexity and running time $c_{d}epsilo{n}^{-1}$, where $a_d<1$ and $c_d$ depend only on $d$. To analyze the testers we establish several combinatorial results, including the following $d$-dimensional modification lemma, which might be of independent interest: for any large enough pattern $P$ over any alphabet (excluding a small set of exceptional patterns for the binary case), and any array $A$ containing a copy of $P$, one can delete this copy by modifying one of its locations without creating new $P$-copies in $A$. Our results address an open question of Fischer and Newman, who asked whether there exist efficient testers for properties related to tight substructures in multi-dimensional structured data. They serve as a first step towards a general understanding of local properties of multi-dimensional arrays, as any such property can be characterized by a fixed family of forbidden patterns.

Full work available at URL: https://arxiv.org/abs/1607.03961

Recommendations

• Testing for forbidden order patterns in an array
• Testing for forbidden order patterns in an array
• SOFSEM 2004: Theory and Practice of Computer Science
• Detecting arrays and their optimality
• THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
• scientific article; zbMATH DE number 2101404
• On the intricacy of avoiding multiple-entry arrays
• Deletion-restriction for subspace arrangements

zbMATH Keywords

pattern matchingproperty testingsublinear algorithms

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Randomized algorithms (68W20)

Cited In (5)

• Title not available (Why is that?)
• Efficient Removal Lemmas for Matrices
• Earthmover Resilience and Testing in Ordered Structures
• Testing connectedness of images
• Efficient removal lemmas for matrices

This page was built for publication: Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111338)