MétaCan
Menu
Back to cohort

The Network Dynamics of Conventions

2019· article· en· W2965853670 on OpenAlexaff
Joshua Becker

Bibliographic record

VenueAcademy of Management Proceedings · 2019
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsKellogg's (Canada)
Fundersnot available
KeywordsConvergence (economics)Computer scienceStochastic gameProcess (computing)ConventionNetwork formationMathematical optimizationDistributed computingMicroeconomicsMathematicsEconomics

Abstract

fetched live from OpenAlex

How does network structure shape the emergence of social and technological conventions? Social and organizational networks tend to have a small number of well-connected “central” nodes that are far more connected than the average individual. Previous research has shown that such “centralized” networks can be advantageous when speed is a priority, because central individuals can spread new practices and technologies and can coordinate the actions of the network as a whole. However, when multiple strategies compete for adoption, the fastest process may not select the optimal strategy. This paper presents theoretical results from a computational model of convention formation showing that centralization does increase speed of convergence, but also decreases the probability that the best strategy will become widely adopted. While these results may suggest a speed-optimality trade-off, an examination of network density shows that speed is not inherently problematic, as dense networks are both fast and optimal. The deleterious effects of network centralization are explained instead by the influence of central nodes. In centralized networks, the influence of central nodes allow their solutions to spread at the expense of less popular but higher payoff solutions.

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.002
metaresearch head score (Gemma)0.021
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.008
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.021
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0020.002
Science and technology studies0.0020.004
Scholarly communication0.0050.009
Open science0.0010.002
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0080.001

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.008
GPT teacher head0.250
Teacher spread0.243 · 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

Citations0
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueAcademy of Management ProceedingsSame topicComplex Network Analysis TechniquesFrench-language works237,207