About: Optimal group testing under real world restrictions

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Optimal group testing under real world restrictions Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : wasabi.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	Optimal group testing under real world restrictions
Creator	Gebhard, Oliver Rolvien, Maurice Hahn-Klimroth, Max Parczyk, Olaf Penschuck, Manuel
Source	ArXiv
abstract	In the group testing problem one aims to infer a small set of $k$ infected individuals out of a large population of size $n$. At our disposal we have a testing scheme which allows us to test a group of individuals, such that the outcome of the test is positive, if and only if at least one infected individual is part of the test. All tests are carried out in parallel. The overall goal is to find a test design and an inference algorithm requiring as few tests as possible, such that the infected individuals can be identified with high probability. As most relevant during the outbreak of pandemic diseases (Wang et al., 2011), our analysis focusses on the so-called sublinear regime of group testing, where $k /sim n^/theta$. The optimal group testing schemes require a test-size of $/sim n/k$ and each individual has to take part in $/sim /log n$ tests (Coja-Oghlan et. al, 2019). In real world applications, like testing many individuals in a short period of time during the outbreak of epidemics, pooling in such a way is not possible due to dilution effects. Evidence of those effects is known for important applications like HIV (Wein, 1996) or COVID-19 (Seifried and Ciesek, 2020). Our main contribution is the analysis of a group testing model, where we restrict the individuals-per-test to be finite. We present an easy to implement scheme to pool individuals into tests under these natural restrictions coming with the efficient decoding algorithm DD and present simulations which suggest that the decoding procedure succeeds for moderate population sizes. Furthermore, we show that our pooling scheme requires the fewest tests as possible under all pooling schemes. Finally, we apply our methods to the finitely many tests-per-individuals setting, where we provide a full understanding of the random regular test-design in this model by building up on work of (Gandikota et al., 2016).
has issue date	2020-04-24(xsd:dateTime)
has license	arxiv
sha1sum (hex)	af967c8c92d92d507fd49f8c2a8ae10f086b3df4
resource representing a document's title	Optimal group testing under real world restrictions
resource representing a document's body	covid:af967c8c92d92d507fd49f8c2a8ae10f086b3df4#body_text
is schema:about of	named entity 'THESE' named entity 'KNOWN' named entity 'POPULATION' named entity 'RANDOM' named entity '2011' named entity 'TO TEST' named entity 'PROVIDE' named entity 'POSITIVE' named entity 'PRESENT' named entity 'GROUP TESTING' named entity 'SETTING' named entity 'POPULATION SIZES' named entity 'UNDERSTANDING' named entity 'test design' named entity 'algorithm' named entity 'inference' named entity '2.1' named entity 'ground truth' named entity 'B.19' named entity 'configuration model' named entity 'COVID-19' named entity 'regular graph' named entity '2.2' named entity 'B.17' named entity 'phase transitions' named entity 'half-edges' named entity 'probability' named entity 'sparsity' named entity 'phase transitions' named entity 'phase transitions' named entity 'h.p.' named entity 'hamming weight' named entity 'algorithm' named entity 'probability' named entity 'h.p.' named entity 'constraint satisfaction' named entity 'multi-graph' named entity '3.8' named entity 'combinatorics' named entity 'probability' named entity '1/2' named entity 'information-theoretically' named entity 'information-theoretic' named entity 'test-design' named entity 'information-theoretic' named entity 'Chernoff bound' named entity 'h.p.' named entity 'integer' named entity 'information-theoretically' named entity 'phase transition' named entity 'comparison-based' named entity 'h.p.' named entity 'algorithm' named entity 'probability' named entity 'integer' named entity 'Hamming weight' named entity 'non-adaptive group testing' named entity 'algorithm' named entity 'information-theoretic' named entity 'information theoretic' named entity 'h.p.' named entity 'configuration model' named entity 'false positives' named entity '1/2' named entity 'information theoretic' named entity 'constraint satisfaction' named entity 'probability' named entity 'protein' named entity 'probability' named entity 'D.5' named entity 'inference' named entity 'random variable' named entity 'random graph' named entity 'algorithm' named entity 'algorithm' named entity 'independent random variables' named entity 'algorithm' named entity 'independent variables' named entity 'random vector' named entity 'half-edges' named entity 'degree sequence' named entity 'expected number' named entity 'rare disease'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software