Coja-Oghlan, AminAminCoja-OghlanHahn-Klimroth, Maximilian GrischaMaximilian GrischaHahn-KlimrothHintze, LukasLukasHintzeSchallmoser, DominikDominikSchallmoserKrieg, LenaLenaKriegRolvien, MauriceMauriceRolvienScheftelowitsch, OlgaOlgaScheftelowitsch2024-12-102024-12-102024-11-19Combinatorics Probability and Computing (in Press): (2024)https://hdl.handle.net/11420/52406We study the problem of identifying a small number k~nθ, 0<θ <1, of infected individuals within a large population of size n by testing groups of individuals simultaneously. All tests are conducted concurrently. The goal is to minimise the total number of tests required. In this paper, we make the (realistic) assumption that tests are noisy, that is, that a group that contains an infected individual may return a negative test result or one that does not contain an infected individual may return a positive test result with a certain probability. The noise need not be symmetric.We develop an algorithm called SPARC that correctly identifies the set of infected individuals up to o(k) errors with high probability with the asymptotically minimum number of tests. Additionally, we develop an algorithm called SPEX that exactly identifies the set of infected individuals w.h.p. with a number of tests that match the information-theoretic lower bound for the constant column design, a powerful and well-studied test design.en1469-2163|2024https://creativecommons.org/licenses/by/4.0/efficient algorithms | Group testing | inference | random graphsNatural Sciences and Mathematics::519: Applied Mathematics, ProbabilitiesComputer Science, Information and General Works::004: Computer SciencesTechnology::610: Medicine, HealthJournal Articlehttps://doi.org/10.15480/882.1388410.1017/S096354832400033610.15480/882.13884Journal Article