activity
20192026
most citedImproved bounds for noisy group testing with constant tests per item

10 citations · 17 across the 7 of their papers we have counts for

collaborators

10 papers

math.CO2026

Fluctuations of the Ising free energy on Erdős-Rényi graphs

Amin Coja-Oghlan, Dominik Kaaser, Maurice Rolvien +2

We investigate the ferromagnetic Ising model on the Erdős-Rényi random graph with bounded average degree . Specifically, we determine the limiting distrib…

cs.DM2025

The random -SAT Gibbs uniqueness threshold revisited

Arnab Chatterjee, Amin Coja-Oghlan, Catherine Greenhill +4

We prove that for any for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of rand…

math.CO2025

Belief Propagation Guided Decimation on Random k-XORSAT

Arnab Chatterjee, Amin Coja-Oghlan, Mihyun Kang +3

We analyse the performance of Belief Propagation Guided Decimation, a physics-inspired message passing algorithm, on the random -XORSAT problem. Specifically, we derive an expli…

cs.DM2024

The number of random 2-SAT solutions is asymptotically log-normal

Arnab Chatterjee, Amin Coja-Oghlan, Noela Müller +4

We prove that throughout the satisfiable phase, the logarithm of the number of satisfying assignments of a random 2-SAT formula satisfies a central limit theorem. This implies that…

cs.DM2024★ 3 cited

Noisy group testing via spatial coupling

Amin Coja-Oghlan, Max Hahn-Klimroth, Lukas Hintze +4

We study the problem of identifying a small set , , of infected individuals within a large population of size by testing groups of individuals simultaneously.…

math.CO2023

The -XORSAT threshold revisited

Amin Coja-Oghlan, Mihyun Kang, Lena Krieg +1

We provide a simplified proof of the random -XORSAT satisfiability threshold theorem. As an extension we also determine the full rank threshold for sparse random matrices over f…

cs.NI2021

Multi-Band Wi-Fi Sensing with Matched Feature Granularity

Jianyuan Yu, Pu, Wang +4

Complementary to the fine-grained channel state information (CSI) from the physical layer and coarse-grained received signal strength indicator (RSSI) measurements, the mid-grained…

cs.IT2020★ 10 cited

Improved bounds for noisy group testing with constant tests per item

Oliver Gebhard, Oliver Johnson, Philipp Loick +1

The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that allows us to test sev…

cs.DS2020★ 4 cited

Near optimal sparsity-constrained group testing: improved bounds and algorithms

Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk +4

Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the subli…

math.CO2019

The rank of sparse random matrices

Amin Coja-Oghlan, Alperen A. Ergür, Pu Gao +2

We determine the rank of a random matrix over an arbitrary field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the r…