MétaCan
Menu
Back to cohort
Record W2963171586 · doi:10.1162/rest_a_00714

Measuring the Graph Concordance of Locally Dependent Observations

2017· article· en· W2963171586 on OpenAlexaff
Kyungchul Song

Bibliographic record

VenueThe Review of Economics and Statistics · 2017
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicSpatial and Panel Data Analysis
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsConcordanceHomophilyMathematicsGraphPermutation (music)Dependency graphDependency (UML)Confidence intervalMeasure (data warehouse)StatisticsEmpirical measureEconometricsComputer scienceDiscrete mathematicsCombinatoricsData miningArtificial intelligenceMedicine

Abstract

fetched live from OpenAlex

This paper introduces a simple measure of a concordance pattern among observed outcomes along a network, that is, the pattern in which adjacent outcomes tend to be more strongly correlated than nonadjacent outcomes. The graph concordance measure can be generally used to quantify the empirical relevance of a network in explaining cross-sectional dependence of the outcomes, and as shown in the paper, it can also be used to quantify the extent of homophily under certain conditions. When one observes a single large network, it is nontrivial to make inferences about the concordance pattern. Assuming a dependency graph, this paper develops a permutation-based confidence interval for the graph concordance measure. The confidence interval is valid in finite samples when the outcomes are exchangeable, and under the dependency graph, an assumption together with other regularity conditions, is shown to exhibit asymptotic validity. Monte Carlo simulation results show that the validity of the permutation method is more robust than the asymptotic method to various graph configurations.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.071
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.071
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.004
Science and technology studies0.0010.003
Scholarly communication0.0020.003
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.121
GPT teacher head0.258
Teacher spread0.137 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations8
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueThe Review of Economics and StatisticsSame topicSpatial and Panel Data AnalysisFrench-language works237,207