Cover Image

Individual testing is optimal for nonadaptive group testing in the linear regime

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Aldridge, Matthew
Format:	Preprint
Published:	2018
Subjects:	Information Theory Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Small error algorithms for tropical group testing
by: Paligadu, Vivekanand, et al.
Published: (2023)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

Information Inequalities for Joint Distributions, with Interpretations and Applications
by: Madiman, Mokshay, et al.
Published: (2008)

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
by: Bruno, Roberto, et al.
Published: (2026)

Equal Requests are Asymptotically Hardest for Data Recovery
by: Lember, Jüri, et al.
Published: (2024)

Bernoulli sums and Rényi entropy inequalities
by: Madiman, Mokshay, et al.
Published: (2021)

Geometry of Rényi Entropy on the Majorization Lattice
by: Yadav, Anuj Kumar, et al.
Published: (2026)

Quantifying Multivariate Graph Dependencies: Theory and Estimation for Multiplex Graphs
by: Skeja, Anda, et al.
Published: (2024)

Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
by: Bresler, Guy, et al.
Published: (2025)

Balls in groups: volume, structure and growth
by: Tessera, Romain, et al.
Published: (2024)

Group Testing: An Information Theory Perspective
by: Aldridge, Matthew, et al.
Published: (2019)

Probabilistic nilpotence in infinite groups
by: Martino, Armando, et al.
Published: (2018)

On the All-Or-Nothing Behavior of Bernoulli Group Testing
by: Truong, Lan V., et al.
Published: (2020)

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity
by: Yu, Lei, et al.
Published: (2021)

Parsings of Stationary Processes, Stopping Times and the Fundamental Pointwise Convergence Theorems of Ergodic Theory
by: Tal, Matan
Published: (2025)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

Sample Complexity of Low-rank Tensor Recovery from Uniformly Random Entries
by: Hamaguchi, Hiroki, et al.
Published: (2024)

Rényi--Sobolev Inequalities and Connections to Spectral Graph Theory
by: Yu, Lei, et al.
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

Resilience of Rademacher chaos of low degree
by: Aigner-Horev, Elad, et al.
Published: (2024)

Randomstrasse101: Open Problems of 2024
by: Bandeira, Afonso S., et al.
Published: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Randomstrasse101: Open Problems of 2025
by: Bandeira, Afonso S., et al.
Published: (2026)

Detecting Arbitrary Planted Subgraphs in Random Graphs
by: Elimelech, Dor, et al.
Published: (2025)

Maximum entropy based testing in network models: ERGMs and constrained optimization
by: Ghosh, Subhro, et al.
Published: (2026)

On the uncommonness of minimal rank-2 systems of linear equations
by: Altman, Daniel, et al.
Published: (2024)

Concentration of information on discrete groups
by: Hermon, Jonathan, et al.
Published: (2024)

Enumeration of walks in multidimensional orthants and reflection groups
by: Gohier, Léa, et al.
Published: (2025)

The VC-dimension of random subsets of finite groups
by: Rodgers, Brad, et al.
Published: (2025)

Symmetric functions and the explicit moment problem for abelian groups
by: Van Peski, Roger
Published: (2024)

The representation ring of the unitary groups and Markov processes of algebraic origin
by: Olshanski, Grigori
Published: (2015)

Representation theory and cycle statistics for random walks on the symmetric group
by: Arcona, Dominic
Published: (2025)

Derangements in finite classical groups and characteristic polynomials of random matrices
by: Fulman, Jason, et al.
Published: (2025)

The Random Subsequence Model and Uniform Codes for the Deletion Channel
by: Jeong, Ryan, et al.
Published: (2026)

Rank fluctuations of matrix products and a moment method for growing groups
by: Nguyen, Hoi H., et al.
Published: (2024)

Fixed points of non-uniform permutations and representation theory of the symmetric group
by: Fulman, Jason
Published: (2024)

Spread-out percolation on transitive graphs of polynomial growth
by: Spanos, Panagiotis, et al.
Published: (2024)

Geometric Littlewood-Offord problems via lattice point counting
by: Grebennikov, Alexandr, et al.
Published: (2025)

Sharp relations between volume growth, isoperimetry and escape probability in vertex-transitive graphs
by: Tessera, Romain, et al.
Published: (2020)