MétaCan
Menu
Back to cohort
Record W2568937866 · doi:10.1109/cdc.2016.7798933

Synchronization of linear time-invariant systems on rooted graphs

2016· article· en· W2568937866 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
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsPassivitySynchronization (alternating current)Control theory (sociology)Topology (electrical circuits)Invariant (physics)Computer scienceProperty (philosophy)Linear systemNetwork topologyMathematicsControl (management)Computer networkEngineeringCombinatorics

Abstract

fetched live from OpenAlex

This paper studies the synchronization properties of networks of identical, linear time-invariant systems. It is shown that networks of passive systems synchronize for any directed and rooted communication topology, thus generalizing a well known result on synchronization in networks of single integrators. If the passivity property is relaxed to output-feedback-passivity, synchronization is proven for arbitrarily large subsets of directed and rooted communication graphs, by imposing a sufficiently high feedback gain. Finally, it is shown that, in networks of single-input single-output systems, passivity is not only sufficient but it is also, to a certain extent, necessary for the above property to hold.

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.000
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: none
Teacher disagreement score0.994
Threshold uncertainty score0.850

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.001

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.010
GPT teacher head0.213
Teacher spread0.203 · 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

Citations17
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Control Multi-Agent SystemsFrench-language works237,207