MétaCan
Menu
Back to cohort
Record W1983074539 · doi:10.2307/3315967

Kendall's tau for serial dependence

2000· article· en· W1983074539 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueCanadian Journal of Statistics · 2000
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicFinancial Risk and Volatility Modeling
Canadian institutionsUniversité Laval
FundersNatural Sciences and Engineering Research Council of CanadaFondation Francqui - Stichting
KeywordsNonparametric statisticsUnivariateMathematicsStatisticsNull hypothesisAutocorrelationAutoregressive modelStatisticMonte Carlo methodAsymptotic distributionContext (archaeology)Series (stratigraphy)Independence (probability theory)Null (SQL)EconometricsParametric statisticsStatistical hypothesis testingApplied mathematicsEstimatorMultivariate statisticsComputer science

Abstract

fetched live from OpenAlex

Abstract The authors show how Kendall's tau can be adapted to test against serial dependence in a univariate time series context. They provide formulas for the mean and variance of circular and noncircular versions of this statistic, and they prove its asymptotic normality under the hypothesis of independence. They present also a Monte Carlo study comparing the power and size of a test based on Kendall's tau with the power and size of competing procedures based on alternative parametric and nonparametric measures of serial dependence. In particular, their simulations indicate that Kendall's tau outperforms Spearman's rho in detecting first‐order autoregressive dependence, despite the fact that these two statistics are asymptotically equivalent under the null hypothesis, as well as under local alternatives.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.663
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.038
GPT teacher head0.217
Teacher spread0.179 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it