
Minimum degree conditions for containing an rregular rconnected subgraph
We study optimal minimum degree conditions when an nvertex graph G cont...
read it

Near optimal efficient decoding from pooled data
The objective of the pooled data problem is to design a measurement matr...
read it

Efficient and accurate group testing via Belief Propagation: an empirical study
The group testing problem asks for efficient pooling schemes and algorit...
read it

Inference and mutual information on random factor graphs
Random factor graphs provide a powerful framework for the study of infer...
read it

Optimal group testing under real world restrictions
In the group testing problem one aims to infer a small set of k infected...
read it

The random 2SAT partition function
We show that throughout the satisfiable phase the normalised number of s...
read it

Optimal adaptive group testing
The group testing problem is concerned with identifying a small number k...
read it

Optimal nonadaptive group testing
In nonadaptive group testing we aim to identify a small set of k∼ n^θ i...
read it

The cut metric for probability distributions
Guided by the theory of graph limits, we investigate a variant of the cu...
read it

Quantitative Group Testing in the Sublinear Regime
The quantitative group testing (QGT) problem deals with efficiently iden...
read it

Informationtheoretic and algorithmic thresholds for group testing
In the group testing problem we aim to identify a small number of infect...
read it
Max HahnKlimroth
is this you? claim profile