162 citations · 853 across the 40 of their papers we have counts for
13 papers · 1 filter
Inference and mutual information on random factor graphs
Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick +3
Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key qua…
Optimal group testing
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +1
In the group testing problem the aim is to identify a small set of infected individuals out of a population size , . We avail ourselves of a test procedure ca…
Information-theoretic and algorithmic thresholds for group testing
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +1
In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multipl…
Charting the replica symmetric phase
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari +2
Diluted mean-field models are spin systems whose geometry of interactions is induced by a sparse random graph or hypergraph. Such models play an eminent role in the statistical mec…
Information-theoretic thresholds from the cavity method
Amin Coja-Oghlan, Florent Krzakala, Will Perkins +1
Vindicating a sophisticated but non-rigorous physics approach called the cavity method, we establish a formula for the mutual information in statistical inference problems induced…
Hypergraph coloring up to condensation
Peter Ayre, Amin Coja-Oghlan, Catherine Greenhill
Improving a result of Dyer, Frieze and Greenhill [Journal of Combinatorial Theory, Series B, 2015], we determine the -colorability threshold in random -uniform hypergraphs up…