MétaCan
Menu
Back to cohort
Record W2023634396 · doi:10.1145/2401603.2401652

Structural controllability of multi-agent networks

2012· article· en· W2023634396 on OpenAlexafffund
M. Amin Rahimian, Amir G. Aghdam

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsControllabilityNetwork controllabilityComputer scienceMulti-agent systemDistributed computingGraph theoryGraphWork (physics)Complex networkTheoretical computer scienceArtificial intelligenceMathematicsEngineeringApplied mathematics

Abstract

fetched live from OpenAlex

This work is concerned with the problem of structural controllability in a leader-follower multi-agent network, and it adopts a graph-theoretic approach to address the issue of preservation of controllability under link and agent failures. To evaluate the role of an agent in the network, the controllability of the multi-agent system with and without that agent is investigated and conclusions are drawn accordingly. It is stated that the importance of agents are reflected in their outgoing links and quantitative measures are offered to characterize the importance of individual agents to the controllability of the overall network. Several examples are presented to elucidate the analytical findings.

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.001
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.028
GPT teacher head0.260
Teacher spread0.233 · 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 designTheoretical or conceptual
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

Citations2
Published2012
Admission routes2
Has abstractyes

Explore more

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