Testing for correlation in Gaussian databases via local decision making

We propose a computationally efficient statistical test for detecting correlation between two Gaussian databases. The problem is formulated as a hypothesis test: under the null hypothesis, the databases are independent; under the alternative hypothesis, they are correlated but subject to an unknown row permutation. We derive bounds on both type Ⅰ and type Ⅱ error probabilities and demonstrate that the proposed test outperforms a recently introduced method across a broad range of parameter settings. The test statistic is based on a sum of dependent indicator random variables. To effectively bound the type Ⅰ error probability, we introduce a novel graph-theoretic technique for bounding the $ k $-th moments of such statistics.

Authors

Institutions

Publication Details

Journal
AIMS Mathematics
Published
2025-01-01
DOI
https://doi.org/10.3934/math.2025355
Citations
1
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Testing for correlation in Gaussian databases via local decision making

Ran Tamir
1 citations
AIMS Mathematics
Privacy-Preserving Technologies in Data
2.48
article

Testing for correlation in Gaussian databases via local decision making

Ran Tamir
article en
1 citations

Abstract

We propose a computationally efficient statistical test for detecting correlation between two Gaussian databases. The problem is formulated as a hypothesis test: under the null hypothesis, the databases are independent; under the alternative hypothesis, they are correlated but subject to an unknown row permutation. We derive bounds on both type Ⅰ and type Ⅱ error probabilities and demonstrate that the proposed test outperforms a recently introduced method across a broad range of parameter settings. The test statistic is based on a sum of dependent indicator random variables. To effectively bound the type Ⅰ error probability, we introduce a novel graph-theoretic technique for bounding the $ k $-th moments of such statistics.

AIMS MathematicsVol. 10(4)
ETH Zurich (CH)
Peace, Justice and strong institutions
Openalex Percentile: Top 11%
Privacy-Preserving Technologies in Data
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.