MétaCan
Menu
Back to cohort
Record W4315472389 · doi:10.1109/cdc51059.2022.9992862

Linear Stochastic Graphon Systems with Q-Space Noise

2022· article· en· W4315472389 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

Venue2022 IEEE 61st Conference on Decision and Control (CDC) · 2022
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsMcGill University
Fundersnot available
KeywordsNoise (video)Computer scienceSpace (punctuation)Linear systemStatistical physicsMathematicsPhysicsMathematical analysisArtificial intelligence

Abstract

fetched live from OpenAlex

The modelling and control of systems on large complex networks is intractable in general. One approach is to use graphon theory which provides limit objects for infinite sequences of graphs permitting one to approximate arbitrarily large networks by infinite dimensional operators. Such a formulation was initiated in the work of Gao and Caines (2020, 2021) extending classical linear system control theory to the control of systems on large networks. This paper introduces infinite dimensional stochastic processes called Q-space noise into this framework. First, Brownian motions in Hilbert spaces are defined. Second, stochastic dynamical systems on large graphs using Q-space noise processes are shown to converge in the graph limit in expectation. Third, state-to-state and linear-quadratic control of these systems is formulated and the limit approximations are established. Finally, the behavior of these approximations is illustrated numerically.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.953
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.023
GPT teacher head0.273
Teacher spread0.250 · 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