Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2108.12418 (cs)
[Submitted on 27 Aug 2021]

Title:Group Testing with Non-identical Infection Probabilities

Authors:Mustafa Doger, Sennur Ulukus
View PDF
Abstract: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 develop an adaptive group testing algorithm that uses the proposed set formation method recursively. We prove novel upper bounds on the number of tests for the proposed algorithm. Via numerical results, we show that our algorithm outperforms the state of the art, and performs close to the entropy lower bound.
Subjects: Information Theory (cs.IT); Computers and Society (cs.CY); Data Structures and Algorithms (cs.DS); Networking and Internet Architecture (cs.NI); Signal Processing (eess.SP)
Cite as: arXiv:2108.12418 [cs.IT]
  (or arXiv:2108.12418v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2108.12418

Submission history

From: Mustafa Doger [view email]
[v1] Fri, 27 Aug 2021 17:53:25 UTC (74 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2021-08
Change to browse by:
cs
cs.CY
cs.DS
cs.NI
eess
eess.SP
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Sennur Ulukus
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)