{"id":"W2286603664","doi":"","title":"Two Laplacians for the Distance Matrix of a Graph","year":2011,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algebraic connectivity; Resistance distance; Laplacian matrix; Distance matrix; Mathematics; Combinatorics; Laplace operator; Connectivity; Eigenvalues and eigenvectors; Discrete mathematics; Distance matrices in phylogeny; Graph; Line graph; Physics; Mathematical analysis; Graph power","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006159049,0.0004666523,0.0003096956,0.001434353,0.0005894863,0.001515765,0.0006124802,0.001004235,0.00955725],"category_scores_gemma":[0.003100249,0.0001318037,0.0004876881,0.0007046561,0.001681794,0.002228553,0.001066741,0.00132679,0.001281879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005869164,"about_ca_system_score_gemma":0.0003732618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004389696,"about_ca_topic_score_gemma":0.0003520692,"domain_scores_codex":[0.9992385,0.0001956613,0.00003856207,0.0001721454,0.0002879378,0.00006727366],"domain_scores_gemma":[0.9987645,0.0004193643,0.000154075,0.0001358025,0.0003783104,0.0001480349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001805903,0.00001654117,0.0001584962,0.00003832412,0.000005791178,0.0001017551,0.0001848107,0.002290943,0.004449769,0.9798007,0.002163832,0.01077099],"study_design_scores_gemma":[0.00001164837,0.00004517111,0.0005912886,0.00002487456,0.000006769953,0.0005583174,0.0001675885,0.03654387,0.001355001,0.9454967,0.01516392,0.00003483213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1115723,0.001787833,0.8026971,0.003420339,0.001346703,0.0001091394,0.000554226,0.0003375483,0.07817487],"genre_scores_gemma":[0.7906772,0.001667551,0.167683,0.001308385,0.0009648609,0.0002638784,0.0004607074,0.0002382577,0.03673619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00955725,"threshold_uncertainty_score":0.03197217,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02990814175960145,"score_gpt":0.2775805357248767,"score_spread":0.2476723939652752,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}