MétaCan
Menu
Back to cohort
Record W2020254517 · doi:10.1088/0951-7715/23/6/002

Dynamical equivalence of networks of coupled dynamical systems: II. General case

2010· article· en· W2020254517 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueNonlinearity · 2010
Typearticle
Languageen
FieldComputer Science
TopicNonlinear Dynamics and Pattern Formation
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDynamical systems theoryMathematicsEquivalence (formal languages)Dynamical system (definition)Topological conjugacyLinear dynamical systemTopology (electrical circuits)Pure mathematicsControl theory (sociology)Mathematical analysisComputer scienceCombinatoricsLinear systemControl (management)PhysicsQuantum mechanics

Abstract

fetched live from OpenAlex

We show that two networks of coupled dynamical systems are dynamically equivalent if and only if they are output equivalent. We also obtain necessary and sufficient conditions for two dynamically equivalent networks to be input equivalent. These results were previously described in the companion paper 'Dynamical equivalence of networks of coupled dynamical systems: I. Asymmetric inputs' but only proved there for the case of asymmetric inputs. In this paper, we allow for symmetric inputs. We also provide a number of examples to illustrate the main results in the case when there are both symmetric and asymmetric inputs.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.863
Threshold uncertainty score0.612

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.0010.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.012
GPT teacher head0.260
Teacher spread0.248 · 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