MétaCan
Menu
Back to cohort
Record W4246793224 · doi:10.32920/ryerson.14660925.v1

Domination number within on-line social networks

2021· preprint· en· W4246793224 on OpenAlexaff
Marc Lozier

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsDomination analysisLine (geometry)CombinatoricsUpper and lower boundsGraphDiscrete mathematicsMathematicsComputer scienceTheoretical computer science

Abstract

fetched live from OpenAlex

There is particular interest in on-line social networks (OSNs) and capturing their properties. The memoryless geometric protean (MGEO-P) model provably simulated many OSN properties. We investigated dominating sets in OSNs and their models. The domination numbers were computed using two algorithms, DS-DC and DS-RAI, for MGEO-P samples and Facebook data, known as the Facebook 100 graphs. We establish sub-linear bounds on the domination numbers for the Facebook 100 graphs, and show that these bounds correlate well with bounds in graphs simulated by MGEO-P. A new model is introduced known as the Distance MGEO-P (DMGEO-P) model. This model incorporates geometric distance to inuence the probability that two nodes are adjacent. Domination number upper bounds were found to be well-correlated with the Facebook 100 graph.

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.020
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: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.020
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.026
GPT teacher head0.318
Teacher spread0.292 · 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
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicComplex Network Analysis TechniquesFrench-language works237,207