MétaCan
Menu
Back to cohort
Record W1983284696 · doi:10.1145/2667522.2667544

On the impact of subgraph insertion or removal on Moore-Penrose Laplacian and resistance distance

2014· article· en· W1983284696 on OpenAlexaff
Ali Tizghadam, Alberto Leon‐Garcia

Bibliographic record

VenueACM SIGMETRICS Performance Evaluation Review · 2014
Typearticle
Languageen
FieldMathematics
TopicGraph theory and applications
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsLaplacian matrixResistance distanceMathematicsRobustness (evolution)Topology (electrical circuits)InverseGraphNetwork topologyInduced subgraph isomorphism problemComputer scienceCombinatoricsLine graphVoltage graphComputer networkGraph powerGene

Abstract

fetched live from OpenAlex

A large body of network-related problems can be formulated or explained by Moore-Penrose inverse of the graph Laplacian matrix of the network. This paper studies the impact of overlaying or removing a subgraph (inserting / removing a group of links, or modifying a set of link weights) on Moore-Penrose inverse of the Laplacian matrix of an existing network topology. Moreover, an iterative method is proposed to find point-to-point resistance distance (effective resistance) and network criticality of a graph as key performance measures to study the robustness of a network at the presence of subgraph insertion and/or subgraph removal.

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 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.006
metaresearch head score (Gemma)0.013
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
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.114
Threshold uncertainty score0.996

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0060.013
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
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.101
GPT teacher head0.387
Teacher spread0.286 · 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 teacher head, not a consensus.

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

Citations1
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueACM SIGMETRICS Performance Evaluation ReviewSame topicGraph theory and applicationsFrench-language works237,207