MétaCan
Menu
Back to cohort
Record W2769227974 · doi:10.1093/comnet/cnz019

Local clustering coefficient of spatial preferential attachment model

2019· preprint· en· W2769227974 on OpenAlexafffund
Lenar Iskhakov, Paweł Prałat, Liudmila Prokhorenkova

Bibliographic record

VenueJournal of Complex Networks · 2019
Typepreprint
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsToronto Metropolitan University
FundersNatural Sciences and Engineering Research Council of CanadaRussian Foundation for Basic Research
KeywordsCluster analysisClustering coefficientPreferential attachmentVertex (graph theory)Computer scienceComplex networkMathematicsStatistical physicsCombinatoricsPhysicsGraphArtificial intelligence

Abstract

fetched live from OpenAlex

In this article, we study the clustering properties of the spatial preferential attachment (SPA) model. This model naturally combines geometry and preferential attachment using the notion of spheres of influence. It was previously shown in several research papers that graphs generated by the SPA model are similar to real-world networks in many aspects. Also, this model was successfully used for several practical applications. However, the clustering properties of the SPA model were not fully analysed. The clustering coefficient is an important characteristic of complex networks which is tightly connected with its community structure. In this article, we study the behaviour of |$C(d)$|⁠, which is the average local clustering coefficient for the vertices of degree |$d$|⁠. It was empirically shown that in real-world networks |$C(d)$| usually decreases as |$d^{-a}$| for some |$a>0$| and it was often observed that |$a=1$|⁠. We prove that in the SPA model |$C(d)$| decreases as |$1/d$|⁠. Furthermore, we are also able to prove that not only the average but also the individual local clustering coefficient of a vertex |$v$| of degree |$d$| behaves as |$1/d$| if |$d$| is large enough. The obtained results further confirm the suitability of the SPA model for fitting various real-world complex networks.

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.001
metaresearch head score (Gemma)0.009
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.001
Scholarly communication0.0010.003
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.031
GPT teacher head0.299
Teacher spread0.268 · 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

Citations2
Published2019
Admission routes2
Has abstractyes

Explore more

Same venueJournal of Complex NetworksSame topicComplex Network Analysis TechniquesFrench-language works237,207