MétaCan
Menu
Back to cohort
Record W2784072063 · doi:10.1109/cdc.2017.8263796

The control of arbitrary size networks of linear systems via graphon limits: An initial investigation

2017· article· en· W2784072063 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

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicGraph theory and applications
Canadian institutionsMcGill University
Fundersnot available
KeywordsControllabilityLimit (mathematics)Sequence (biology)Computer scienceState (computer science)Control systemControl (management)Linear systemUpper and lower boundsDiscrete mathematicsTask (project management)Theoretical computer scienceAlgorithmMathematicsApplied mathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

To achieve control objectives for extremely complex and very large scale networks using standard methods is a challenging, if not intractable, task. In this paper, we propose a novel way to approximately control network systems which lie in a sequence with a well defined limit by the use of graphon theory and the theory of infinite dimensional systems. The general controllability problem is analyzed for the infinite system and then the control performance in terms of the upper bound for the L <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> state error between the limit system and the sequence of network systems is given. Finally, an example of the application of the minimum energy control methodology for network systems with sampled weightings is demonstrated.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.056
Threshold uncertainty score0.294

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.045
GPT teacher head0.315
Teacher spread0.270 · 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

Quick stats

Citations28
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicGraph theory and applicationsFrench-language works237,207