MétaCan
Menu
Back to cohort
Record W1976949588 · doi:10.1142/s0219525911003207

THE SMALL-WORLD PROPERTY IN NETWORKS GROWING BY ACTIVE EDGES

2011· article· en· W1976949588 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.

Bibliographic record

VenueAdvances in Complex Systems · 2011
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsSmall-world networkProbabilistic logicComputer scienceAverage path lengthFocus (optics)Property (philosophy)Clustering coefficientLogarithmSimple (philosophy)Cluster analysisComplex networkFractalArtificial intelligenceAlgorithmMathematicsTheoretical computer sciencePhysics

Abstract

fetched live from OpenAlex

In the last three years, we have witnessed an increasing number of complex network models based on a 'fractal' approach, in which parts of the network are repeatedly replaced by a given pattern. Our focus is on models that can be defined by repeatedly adding a pattern network to selected edges, called active edges. We prove that when a pattern network has at least two active edges, then the resulting network has an average distance at most logarithmic in the number of nodes. This suggests that real-world networks based on a similar growth mechanism are likely to have small average distance. We provide an estimate of the clustering coefficient and verify its accuracy using simulations. Using numerous examples of simple patterns, our simulations show various ways to generate small-world networks. Finally, we discuss extensions to our framework encompassing probabilistic patterns and active subnetworks.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.950
Threshold uncertainty score0.595

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.035
GPT teacher head0.268
Teacher spread0.233 · 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