Logarithmic Asymptotic Relations Between $p$-Values and Mutual Information
Tsutomu Mori, Takashi Kawamura

TL;DR
This paper establishes a precise asymptotic relationship between p-values and mutual information, clarifying how MI governs the tail behavior of p-values in dependence testing and enabling unified meta-analyses.
Contribution
It derives a logarithmic asymptotic relation between p-values and mutual information, connecting information theory with statistical significance in dependence testing.
Findings
Fisher's exact test p-value satisfies a specific asymptotic relation with MI.
MI acts as the exponential rate in the tail probability of p-values.
Results facilitate comparison of dependence across datasets with different sample sizes.
Abstract
We establish a precise connection between statistical significance in dependence testing and information-theoretic dependence as quantified by Shannon mutual information (MI). In the absence of prior distributional information, we consider a maximum-entropy model and show that the probability associated with the realization of a given magnitude of MI takes an exponential form, yielding a corresponding tail-probability interpretation of a -value. In contingency tables with fixed marginal frequencies, we analyze Fisher's exact test and prove that its -value satisfies a logarithmic asymptotic relation of the form as the sample size . These results clarify the role of MI as the exponential rate governing the asymptotic behavior of -values in the settings studied here, and they enable principled comparisons of dependence across…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Mechanics and Entropy · Quantum Mechanics and Applications
