Analytic Formulas for the Sample Moments of the Sample Correlation over Permutations of Data

Marc Jaffrey, Michael Dushkoff

备注：: 4 Pages, 1 Table

英文摘要：

Presented is an inductive formula for computing the sample moments of the distribution of Pearson's sample correlation over permutation of data. These exact formulas for the sample moments suggest the possibility of more precise and computationally efficient methods of evaluating the p-value for a hypothesis test of Pearson's correlation.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Derivation of Analytic Formulas for the Sample Moments of the Sample Correlation over Permutations of Data

Pearson's correlation is among the mostly widely reported measures of association. The strength of the statistical evidence for linear association is determined by the p-value of a hypothesis test. If the true distribution of a dataset is bivariate normal, then under specific data transformations a t-statistic returns the exact p-value, otherwise it is an approximation. Alternatively, the p-value can be estimated by analyzing the distribution of the sample correlation under permutations of the data. Moment approximations of this distribution are not as widely used since estimation of the momen…

2021-08-28math.STstat.TH

Moments of permutation statistics and central limit theorems

We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with constant coefficients. This generalizes a result of Zeilberger. We use an approach of Chern, Diaconis, Kane and Rhoades, previously applied on set partitions and matchings. In addition, we give a new proof of the central limit theorem (CLT) for the number of occurrences of classical patterns, which uses a lemma of Burstein and Hasto. We give a simple interpretation of this lemma and an analogous lemma that would impl…

2021-09-19math.COmath.STstat.TH

Learning Mixtures of Permutations: Groups of Pairwise Comparisons and Combinatorial Method of Moments

Georgia Institute of Technology（佐治亚理工学院）；Yale University（耶鲁大学）

In applications such as rank aggregation, mixture models for permutations are frequently used when the population exhibits heterogeneity. In this work, we study the widely used Mallows mixture model. In the high-dimensional setting, we propose a polynomial-time algorithm that learns a Mallows mixture of permutations on $n$ elements with the optimal sample complexity that is proportional to $\log n$, improving upon previous results that scale polynomially with $n$. In the high-noise regime, we characterize the optimal dependency of the sample complexity on the noise parameter. Both objectives a…

2022-03-04cs.DScs.LGmath.ST

Fast and direct nonparametric procedures in the L-moment homogeneity test

Regional frequency analysis is an important tool to properly estimate hydrological characteristics at ungauged or partially gauged sites in order to prevent hydrological disasters. The delineation of homogeneous groups of sites is an important first step in order to transfer information and obtain accurate quantile estimates at the target site. The Hosking-Wallis homogeneity test is usually used to test the homogeneity of the selected sites. Despite its usefulness and good power, it presents some drawbacks including the subjective choice of a parametric distribution for the data and a poorly j…

2016-10-18stat.ME

Score Permutation Based Finite Sample Inference for Generalized AutoRegressive Conditional Heteroskedasticity (GARCH) Models

Institute for Computer Science and Control (SZTAKI)（计算机科学与控制研究所（SZTAKI））；Hungarian Academy of Sciences (MTA)（匈牙利科学院（MTA））

A standard model of (conditional) heteroscedasticity, i.e., the phenomenon that the variance of a process changes over time, is the Generalized AutoRegressive Conditional Heteroskedasticity (GARCH) model, which is especially important for economics and finance. GARCH models are typically estimated by the Quasi-Maximum Likelihood (QML) method, which works under mild statistical assumptions. Here, we suggest a finite sample approach, called ScoPe, to construct distribution-free confidence regions around the QML estimate, which have exact coverage probabilities, despite no additional assumptions …

2018-07-23cs.LGecon.EMmath.DS

Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance

Stanford University（斯坦福大学）

We present \emph{Local Moment Matching (LMM)}, a unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance. We construct an efficiently computable estimator that achieves the minimax rates in estimating the distribution up to permutation, and show that the plug-in approach of our unlabeled distribution estimator is "universal" in estimating symmetric functionals of discrete distributions. Instead of doing best polynomial approximation explicitly as in existing literature of functional estimation, the plug-in approach conducts polynomial appr…

2018-06-26cs.ITcs.LGmath.IT

更多相关论文收起更多论文

Change-point detection for multivariate and non-Euclidean data with local dependency

In a sequence of multivariate observations or non-Euclidean data objects, such as networks, local dependence is common and could lead to false change-point discoveries. We propose a new way of permutation -- circular block permutation with a random starting point -- to address this problem. This permutation scheme is studied on a non-parametric change-point detection framework based on a similarity graph constructed on the observations, leading to a general framework for change-point detection for data with local dependency. Simulation studies show that this new framework retains the same leve…

2019-03-05stat.ME

Functional Response Designs via the Analytic Permutation Test

Vast literature on experimental design extends from Fisher and Snedecor to the modern day. When data lies beyond the assumption of univariate normality, nonparametric methods including rank based statistics and permutation tests are enlisted. The permutation test is a versatile exact nonparametric significance test that requires drastically fewer assumptions than similar parametric tests. The main downfall of the permutation test is high computational cost making this approach laborious for complex data and sophisticated experimental designs and completely infeasible in any application requiri…

2021-11-10math.FAmath.PRmath.ST