Exact Thresholds for Noisy Non-Adaptive Group Testing
Fuente:
arXiv
Saved in:
| Main Authors: | Chen, Junren, Scarlett, Jonathan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Group Testing: An Information Theory Perspective
by: Aldridge, Matthew, et al.
Published: (2019)
by: Aldridge, Matthew, et al.
Published: (2019)
A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs
by: Ta, Hoang, et al.
Published: (2025)
by: Ta, Hoang, et al.
Published: (2025)
Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
by: Bangachev, Kiril, et al.
Published: (2024)
by: Bangachev, Kiril, et al.
Published: (2024)
The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)
by: Lee, Daniel, et al.
Published: (2025)
Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026)
by: Canonne, Clément L., et al.
Published: (2026)
On The Fourier Coefficients of High-Dimensional Random Geometric Graphs
by: Bangachev, Kiril, et al.
Published: (2024)
by: Bangachev, Kiril, et al.
Published: (2024)
On the All-Or-Nothing Behavior of Bernoulli Group Testing
by: Truong, Lan V., et al.
Published: (2020)
by: Truong, Lan V., et al.
Published: (2020)
Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)
by: Aigner-Horev, Elad, 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)
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)
by: Wang, Geyang, et al.
Published: (2026)
Combinatorial Group Testing in Presence of Deletions
by: Gandikota, Venkata, et al.
Published: (2023)
by: Gandikota, Venkata, et al.
Published: (2023)
Threshold rates for properties of random codes
by: Guruswami, Venkatesan, et al.
Published: (2020)
by: Guruswami, Venkatesan, et al.
Published: (2020)
Optimal Non-Adaptive Group Testing with One-Sided Error Guarantees
by: McMorrow, Daniel, et al.
Published: (2025)
by: McMorrow, Daniel, et al.
Published: (2025)
Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
by: Li, Xiaxin, et al.
Published: (2024)
by: Li, Xiaxin, et al.
Published: (2024)
Optimally revealing bits for rejection sampling
by: Langevin, Louis-Roy, et al.
Published: (2025)
by: Langevin, Louis-Roy, et al.
Published: (2025)
Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
by: Liu, Hai, et al.
Published: (2026)
by: Liu, Hai, et al.
Published: (2026)
Six Permutation Patterns Force Quasirandomness
by: Crudele, Gabriel, et al.
Published: (2023)
by: Crudele, Gabriel, et al.
Published: (2023)
A Group Theoretic Construction of Batch Codes
by: Thomas, Eldho K.
Published: (2025)
by: Thomas, Eldho K.
Published: (2025)
Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
by: Hintze, Lukas, et al.
Published: (2024)
by: Hintze, Lukas, et al.
Published: (2024)
A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)
by: Chinyaev, Boris
Published: (2025)
Efficient Online Random Sampling via Randomness Recycling
by: Draper, Thomas L., et al.
Published: (2025)
by: Draper, Thomas L., et al.
Published: (2025)
Efficient Rejection Sampling in the Entropy-Optimal Range
by: Draper, Thomas L., et al.
Published: (2025)
by: Draper, Thomas L., et al.
Published: (2025)
Fair Allocation of Indivisible Goods with Variable Groups
by: Gölz, Paul, et al.
Published: (2025)
by: Gölz, Paul, et al.
Published: (2025)
Ergodic properties of concurrent systems
by: Abbes, Samy, et al.
Published: (2025)
by: Abbes, Samy, et al.
Published: (2025)
Bringing order to network centrality measures
by: Exarchakos, G., et al.
Published: (2026)
by: Exarchakos, G., et al.
Published: (2026)
Bad local minima exist in the stochastic block model
by: Coja-Oghlan, Amin, et al.
Published: (2024)
by: Coja-Oghlan, Amin, et al.
Published: (2024)
Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery
by: Ameen, Taha, et al.
Published: (2024)
by: Ameen, Taha, et al.
Published: (2024)
Reconstruction of multiple strings of constant weight from prefix-suffix compositions
by: Yang, Yaoyu, et al.
Published: (2024)
by: Yang, Yaoyu, et al.
Published: (2024)
Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
by: Bangachev, Kiril, et al.
Published: (2024)
by: Bangachev, Kiril, et al.
Published: (2024)
The Graph Pencil Method: Mapping Subgraph Densities to Stochastic Block Models
by: Gunderson, Lee M, et al.
Published: (2024)
by: Gunderson, Lee M, et al.
Published: (2024)
Enumeration of Row-Column Designs
by: Jäger, Gerold, et al.
Published: (2024)
by: Jäger, Gerold, et al.
Published: (2024)
On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)
by: Conlon, David, et al.
Published: (2024)
Graph-theoretical estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)
by: Hirata, So
Published: (2024)
Thresholds for Reconstruction of Random Hypergraphs From Graph Projections
by: Bresler, Guy, et al.
Published: (2025)
by: Bresler, Guy, et al.
Published: (2025)
Common information in well-mixing graphs and applications to information-theoretic cryptography
by: Caillat-Grenier, Geoffroy, et al.
Published: (2024)
by: Caillat-Grenier, Geoffroy, et al.
Published: (2024)
New Solutions to Delsarte's Dual Linear Programs
by: Chailloux, André, et al.
Published: (2024)
by: Chailloux, André, et al.
Published: (2024)
Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding
by: Li, Yun-Han, et al.
Published: (2024)
by: Li, Yun-Han, et al.
Published: (2024)
Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings
by: Romashchenko, Andrei
Published: (2025)
by: Romashchenko, Andrei
Published: (2025)
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
by: Gürpınar, Emirhan, et al.
Published: (2020)
by: Gürpınar, Emirhan, et al.
Published: (2020)
Information Content and Entropy of Finite Patterns from a Combinatorial Perspective
by: Pocze, Zsolt
Published: (2025)
by: Pocze, Zsolt
Published: (2025)
Similar Items
-
Group Testing: An Information Theory Perspective
by: Aldridge, Matthew, et al.
Published: (2019) -
A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs
by: Ta, Hoang, et al.
Published: (2025) -
Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
by: Bangachev, Kiril, et al.
Published: (2024) -
The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025) -
Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026)