In many studies, we want to determine the influence of certain features ...
In the pooled data problem we are given n agents with hidden state bits,...
We study the group testing problem where the goal is to identify a set o...
We consider the so-called Independent Cascade Model for rumor spreading ...
We study the Consensus problem among n agents, defined as follows.
Initi...
In the pooled data problem we are given a set of n agents, each of which...
We derive a sufficient condition for a sparse random matrix with given
n...
We study optimal minimum degree conditions when an n-vertex graph G
cont...
The objective of the pooled data problem is to design a measurement matr...
The group testing problem asks for efficient pooling schemes and algorit...
Random factor graphs provide a powerful framework for the study of infer...
In the group testing problem one aims to infer a small set of k infected...
We show that throughout the satisfiable phase the normalised number of
s...
The group testing problem is concerned with identifying a small number k...
In non-adaptive group testing we aim to identify a small set of k∼
n^θ i...
Guided by the theory of graph limits, we investigate a variant of the cu...
The quantitative group testing (QGT) problem deals with efficiently
iden...
In the group testing problem we aim to identify a small number of infect...