English
Related papers

Related papers: Group Testing for Efficiently Sampling Hypergraphs…

200 papers

In this paper, we introduce a variation of the group testing problem capturing the idea that a positive test requires a combination of multiple ``types'' of item. Specifically, we assume that there are multiple disjoint \emph{semi-defective…

Information Theory · Computer Science 2024-05-10 Thach V. Bui , Jonathan Scarlett

Group testing enables to identify infected individuals in a population using a smaller number of tests than individual testing. To achieve this, group testing algorithms commonly assume knowledge of the number of infected individuals;…

Information Theory · Computer Science 2023-05-16 Chaorui Yao , Pavlos Nikolopoulos , Christina Fragouli

We study the problem of determining exactly the number of defective items in an adaptive Group testing by using a minimum number of tests. We improve the existing algorithm and prove a lower bound that shows that the number of tests in our…

Information Theory · Computer Science 2020-01-03 Nader H. Bshouty , Catherine A. Haddad-Zaknoon , Raghd Boulos , Foad Moalem , Jalal Nada , Elias Noufi , Yara Zaknoon

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether at least one defective item is present. This problem is relevant in areas such as medical…

Information Theory · Computer Science 2022-10-24 Eric Price , Jonathan Scarlett , Nelvin Tan

Group testing is a well-known search problem that consists in detecting of $s$ defective members of a set of $t$ samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all…

Information Theory · Computer Science 2019-05-01 Ilya Vorobyev

We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower bound that show that, for constant estimation, the number…

Data Structures and Algorithms · Computer Science 2023-12-22 Nader H. Bshouty , Vivian E. Bshouty-Hurani , George Haddad , Thomas Hashem , Fadi Khoury , Omar Sharafy

We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily…

Information Theory · Computer Science 2018-07-24 Tongxin Li , Chun Lam Chan , Wenhao Huang , Tarik Kaced , Sidharth Jaggi

Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find…

Information Theory · Computer Science 2016-07-05 A. G. D'yachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

Assessing risk of cascading failure in an electrical grid requires identifying many small "defective" subsets of the N elements in a power system, such that the simultaneous failure of all elements in a defective set triggers a large…

Physics and Society · Physics 2019-09-11 Laurence A. Clarfeld , Margaret J. Eppstein

In group testing, the task is to identify defective items by testing groups of them together using as few tests as possible. We consider the setting where each item is defective with a constant probability $\alpha$, independent of all other…

Discrete Mathematics · Computer Science 2024-11-15 Lukas Hintze , Lena Krieg , Olga Scheftelowitsch , Haodong Zhu

We study the problem of estimating the number of defective items $d$ within a pile of $n$ elements up to a multiplicative factor of $\Delta>1$, using deterministic group testing algorithms. We bring lower and upper bounds on the number of…

Information Theory · Computer Science 2020-09-08 Nader H. Bshouty , Catherine A. Haddad-Zaknoon

The conventional model of disjunctive group testing assumes that there are several defective elements (or defectives) among a large population, and a group test yields the positive response if and only if the testing group contains at least…

Information Theory · Computer Science 2019-08-20 A. G. D'yachkov , N. A. Polyanskii , V. Yu. Shchukin , I. V. Vorobyev

The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no…

Information Theory · Computer Science 2026-05-15 Matthew Aldridge , Oliver Johnson , Jonathan Scarlett

Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find…

Information Theory · Computer Science 2016-11-18 A. G. D'yachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

The problem of Group Testing is to identify defective items out of a set of objects by means of pool queries of the form "Does the pool contain at least a defective?". The aim is of course to perform detection with the fewest possible…

Statistical Mechanics · Physics 2009-11-13 M. Mézard , M. Tarzia , C. Toninelli

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, data…

Information Theory · Computer Science 2020-11-11 Nelvin Tan , Jonathan Scarlett

The group testing problem consists of determining a sparse subset of defective items from within a larger set of items via a series of tests, where each test outcome indicates whether at least one defective item is included in the test. We…

Information Theory · Computer Science 2026-04-24 Daniel McMorrow , Jonathan Scarlett

We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of $n$ items contains a subset of $d \ll n$ defective items. Subsets (pools) of the $n$ items are tested -- the test…

Information Theory · Computer Science 2013-04-25 Chun Lam Chan , Sheng Cai , Mayank Bakshi , Sidharth Jaggi , Venkatesh Saligrama

Group testing is a well-known search problem that consists in detecting of $s$ defective members of a set of $t$ samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all…

Information Theory · Computer Science 2020-05-19 Ilya Vorobyev

Group-testing refers to the problem of identifying (with high probability) a (small) subset of $D$ defectives from a (large) set of $N$ items via a "small" number of "pooled" tests. For ease of presentation in this work we focus on the…

Information Theory · Computer Science 2013-07-11 Sheng Cai , Mohammad Jahangoshahi , Mayank Bakshi , Sidharth Jaggi
‹ Prev 1 2 3 10 Next ›