MétaCan
Menu
Back to cohort
Record W2518448515 · doi:10.4310/cms.2016.v14.n6.a12

An SIS-type marketing model on random networks

2016· article· en· W2518448515 on OpenAlexafffund
Reinhard Illner, Junling Ma

Bibliographic record

VenueCommunications in Mathematical Sciences · 2016
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversity of Victoria
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsType (biology)MathematicsRandom graphStatistical physicsDiscrete mathematicsPhysicsGeology

Abstract

fetched live from OpenAlex

Marketing on random networks displays similarities to epidemiological models in the sense that "word-of-mouth" information passes between individuals and may "infect" susceptible buyers such that they end up buying the product.The difference to epidemics is that there are usually many competing products (rather than just one disease), and in addition to word-of-mouth transmission, products are also advertised by the producers, which can be thought of as external nodes connected to the network.In this paper we develop a model in which these various transmission pathways compete, and, in addition, where product fatigue and product switching are possible.This is a genuine and realistic extension of the model developed in [M.Li, R. Edwards, R. Illner, and J. Ma, Commun.Math.Sci., 13, 497-509, 2015], where a customer would never abandon a product after purchase.The model presented here is similar to and was inspired by SIS epidemiological models.We discuss the homogeneous limit for a fully connected graph, present some analytical properties of the models and conduct a number of numerical experiments, including an investigation of a modelling assumption we call "edge chaos".The validity of this assumption turns out to depend on the type of the underlying random network.

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.005
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: none
Teacher disagreement score0.015
Threshold uncertainty score0.050

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0020.002
Science and technology studies0.0010.002
Scholarly communication0.0030.004
Open science0.0030.001
Research integrity0.0040.002
Insufficient payload (model declined to judge)0.0150.002

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.063
GPT teacher head0.372
Teacher spread0.309 · 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

Citations6
Published2016
Admission routes2
Has abstractyes

Explore more

Same venueCommunications in Mathematical SciencesSame topicComplex Network Analysis TechniquesFrench-language works237,207