no code implementations • 15 Jun 2022 • Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik
For the Bernoulli design, we determine the precise number of tests required to solve the associated detection problem (where the goal is to distinguish between a group testing instance and pure noise), improving both the upper and lower bounds of Truong, Aldridge, and Scarlett (2020).
no code implementations • 1 Feb 2021 • Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean B. Ravelomanana
In effect, the analysis of the fixed point of the message passing process on a random graph reduces to analysing the process on a Galton-Watson tree.
Combinatorics 05C80
