English
Related papers

Related papers: Improved bounds for group testing in arbitrary hyp…

200 papers

Hypergraphs are useful mathematical representations of overlapping and nested subsets of interacting units, including groups of genes or brain regions, economic cartels, political or military coalitions, and groups of products that are…

Methodology · Statistics 2026-02-03 Cornelius Fritz , Yubai Yuan , Michael Schweinberger

Given a network represented by a graph $G=(V,E)$, we consider a dynamical process of influence diffusion in $G$ that evolves as follows: Initially only the nodes of a given $S\subseteq V$ are influenced; subsequently, at each round, the set…

Data Structures and Algorithms · Computer Science 2016-10-13 Gennaro Cordasco , Luisa Gargano , Marco Mecchia , Adele A. Rescigno , Ugo Vaccaro

Let G = (V,E) be an n-vertex graph and M_d a d-vertex graph, for some constant d. Is M_d a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(log…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-11-06 Danny Dolev , Christoph Lenzen , Shir Peled

In this paper, we revisit the problem of sampling edges in an unknown graph $G = (V, E)$ from a distribution that is (pointwise) almost uniform over $E$. We consider the case where there is some a priori upper bound on the arboriciy of $G$.…

Computational Complexity · Computer Science 2019-02-22 Talya Eden , Dana Ron , Will Rosenbaum

Real-world systems are often formulated as constrained optimization problems. Techniques to incorporate constraints into Neural Networks (NN), such as Neural Ordinary Differential Equations (Neural ODEs), have been used. However, these…

Machine Learning · Computer Science 2025-03-27 C. Coelho , M. Fernanda P. Costa , L. L. Ferrás

In the distributed triangle detection problem, we have an $n$-vertex network $G=(V,E)$ with one player for each vertex of the graph who sees the edges incident on the vertex. The players communicate in synchronous rounds using the edges of…

Data Structures and Algorithms · Computer Science 2025-08-14 Sepehr Assadi , Janani Sundaresan

We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $\Delta$Y transformations are required in the worst case to reduce an…

Computational Geometry · Computer Science 2015-10-05 Hsien-Chih Chang , Jeff Erickson

Semiquantitative group testing (SQGT) is a pooling method in which the test outcomes represent bounded intervals for the number of defectives. Alternatively, it may be viewed as an adder channel with quantized outputs. SQGT represents a…

Information Theory · Computer Science 2021-02-10 Mahdi Cheraghchi , Ryan Gabrys , Olgica Milenkovic

In the Group Testing problem, the objective is to learn a subset K of some much larger domain N, using the shortest-possible sequence of queries Q. A feedback to a query provides some information about the intersection between the query and…

Data Structures and Algorithms · Computer Science 2021-12-03 Marek Klonowski , Dariusz R. Kowalski , Dominik Pajak

We prove tight lower bounds for online multicalibration, establishing an information-theoretic separation from marginal calibration. In the general setting where group functions can depend on both context and the learner's predictions, we…

Machine Learning · Computer Science 2026-04-27 Natalie Collina , Jiuyao Lu , Georgy Noarov , Aaron Roth

In the classical non-adaptive group testing setup, pools of items are tested together, and the main goal of a recovery algorithm is to identify the "complete defective set" given the outcomes of different group tests. In contrast, the main…

Information Theory · Computer Science 2016-03-01 Abhay Sharma , Chandra R. Murthy

We consider Bernoulli nonadaptive group testing with $k = \Theta(n^\theta)$ defectives, for $\theta \in (0,1)$. The practical definite defectives (DD) detection algorithm is known to be optimal for $\theta \geq 1/2$. We give a new upper…

Information Theory · Computer Science 2017-11-27 Matthew Aldridge

Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN$(t,k,v)$, in a covering array for given values of the…

Combinatorics · Mathematics 2016-03-28 Kaushik Sarkar , Charles J. Colbourn

Among the challenges that the COVID-19 pandemic outbreak revealed is the problem to reduce the number of tests required for identifying the virus carriers in order to contain the viral spread while preserving the tests reliability. To cope…

Information Theory · Computer Science 2021-12-24 Catherine A. Haddad-Zaaknoon

The paper presents an algorithm for minimum vertex cover problem, which is an NP-Complete problem. The algorithm computes a minimum vertex cover of each input simple graph. Tested by the attached MATLAB programs, Stage 1 of the algorithm is…

Discrete Mathematics · Computer Science 2016-10-30 Gang Hu

Combinatorial group testing (CGT) is used to identify defective items from a set of items by grouping them together and performing a small number of tests on the groups. Recently, group testing has been used to design efficient COVID-19…

Discrete Mathematics · Computer Science 2022-11-02 Thais Bardini Idalino , Lucia Moura

Pathogenic infections pose a significant threat to global health, affecting millions of people every year and presenting substantial challenges to healthcare systems worldwide. Efficient and timely testing plays a critical role in disease…

Quantitative Methods · Quantitative Biology 2023-08-03 Ananthan Nambiar , Chao Pan , Vishal Rana , Mahdi Cheraghchi , João Ribeiro , Sergei Maslov , Olgica Milenkovic

Standard high-dimensional factor models assume that the comovements in a large set of variables could be modeled using a small number of latent factors that affect all variables. In many relevant applications in economics and finance,…

Econometrics · Economics 2022-02-08 Antoine Djogbenou , Razvan Sufana

We consider the problem of sequential hypothesis testing by betting. For a general class of composite testing problems -- which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of…

Statistics Theory · Mathematics 2025-04-04 Ian Waudby-Smith , Ricardo Sandoval , Michael I. Jordan

We study sharp detection thresholds for degree corrections in Stochastic Block Models in the context of a goodness of fit problem, and explore the effect of the unknown community assignment (a high dimensional nuisance parameter) and the…

Statistics Theory · Mathematics 2019-07-16 Rajarshi Mukherjee , Subhabrata Sen
‹ Prev 1 8 9 10 Next ›