English
Related papers

Related papers: Compressed Sensing with Probabilistic Measurements…

200 papers

The use of group testing to locate all instances of disease in a large population of blood samples was first considered seventy years ago. Since then, several methods have been used to approximate the minimum expected number of tests. The…

Applications · Statistics 2015-03-24 Seth Zimmerman

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

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

The usual problem for group testing is this: For a given number of individuals and a given prevalence, how many tests T* are required to find every infected individual? In real life, however, the problem is usually different: For a given…

Applications · Statistics 2021-07-21 Matthew Aldridge

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 Curie-Weiss model, originally used to study phase transitions in statistical mechanics, has been adapted to model phenomena in social sciences where many agents interact with each other. Reconstructing the probability measure of a…

Statistics Theory · Mathematics 2025-07-24 Miguel Ballesteros , Ivan Naumkin , Gabor Toth

We consider a network where an infection cascade has taken place and a subset of infected nodes has been partially observed. Our goal is to reconstruct the underlying cascade that is likely to have generated these observations. We reduce…

Social and Information Networks · Computer Science 2018-11-21 Han Xiao , Cigdem Aslay , Aristides Gionis

Bacteria are the unseen majority on our planet, with millions of species and comprising most of the living protoplasm. While current methods enable in-depth study of a small number of communities, a simple tool for breadth studies of…

Genomics · Quantitative Biology 2010-07-21 Amnon Amir , Or Zuk

We consider a zero-error probabilistic group testing problem where individuals are defective independently but not with identical probabilities. We propose a greedy set formation method to build sets of individuals to be tested together. We…

Information Theory · Computer Science 2021-08-30 Mustafa Doger , Sennur Ulukus

Permutation tests are a distribution free way of performing hypothesis tests. These tests rely on the condition that the observed data are exchangeable among the groups being tested under the null hypothesis. This assumption is easily…

Methodology · Statistics 2017-12-14 Daniell Toth

Population protocols are a relatively novel computational model in which very resource-limited anonymous agents interact in pairs with the goal of computing predicates. We consider the probabilistic version of this model, which naturally…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Vladyslav Melnychuk

The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments…

Information Theory · Computer Science 2015-03-17 Mahdi Cheraghchi

We consider two closely related problems: anomaly detection in sensor networks and testing for infections in human populations. In both problems, we have $n$ nodes (sensors, humans), and each node exhibits an event of interest (anomaly,…

Information Theory · Computer Science 2020-12-01 Melih Bastopcu , Sennur Ulukus

In epidemic or pandemic situations, resources for testing the infection status of individuals may be scarce. Although group testing can help to significantly increase testing capabilities, the (repeated) testing of entire populations can…

Populations and Evolution · Quantitative Biology 2021-10-29 Günther Koliander , Georg Pichler

In group testing, simple binary-output tests are designed to identify a small number $t$ of defective items that are present in a large population of $N$ items. Each test takes as input a group of items and produces a binary output…

Information Theory · Computer Science 2017-04-11 Alexander Barg , Arya Mazumdar

In this paper, we derive mutual information based upper and lower bounds on the number of nonadaptive group tests required to identify a given number of "non defective" items from a large population containing a small number of "defective"…

Information Theory · Computer Science 2016-03-01 Abhay Sharma , Chandra R. Murthy

This paper proposes a verification-based decoding approach for reconstruction of a sparse signal with incremental sparse measurements. In its first step, the verification-based decoding algorithm is employed to reconstruct the signal with a…

Information Theory · Computer Science 2013-02-12 Xiaofu Wu , Zhen Yang , Lu Gan

Sampling techniques such as Respondent-Driven Sampling (RDS) are widely used in epidemiology to sample "hidden" populations, such that properties of the network can be deduced from the sample. We consider how similar techniques can be…

Social and Information Networks · Computer Science 2013-04-25 Bowen Yan , Steve Gregory

In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are considered to be defective. We can test certain subsets of the…

Combinatorics · Mathematics 2012-04-09 Dániel Gerbner , Balázs Keszegh , Dömötör Pálvölgyi , Gábor Wiener

We consider a generalization of group testing where the potentially contaminated sets are the members of a given hypergraph ${\cal F}=(V,E)$. This generalization finds application in contexts where contaminations can be conditioned by some…

Data Structures and Algorithms · Computer Science 2023-11-28 Annalisa De Bonis