{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045983,0.0001882107,0.0002553528,0.000053553,0.0004269469,0.00001878656,0.0003988847,0.0001461091,0.0002321829],"category_scores_gemma":[0.000111622,0.0001498559,0.0003070437,0.000292743,0.001027468,0.00007316712,0.00002346651,0.0002211017,0.00002478003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002840535,"about_ca_system_score_gemma":0.00002719052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009918779,"about_ca_topic_score_gemma":0.0001617368,"domain_scores_codex":[0.9989299,0.00008569337,0.0003599322,0.0002068574,0.000116183,0.0003014294],"domain_scores_gemma":[0.9980209,0.0009887102,0.0002473766,0.0005788128,0.00009733468,0.00006681283],"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.00007782281,0.0002408138,0.0001990154,0.000275136,0.0001485523,0.000001846812,0.0100996,0.000003350668,0.0002017359,0.9828296,0.002916557,0.003005926],"study_design_scores_gemma":[0.0005057967,0.00005579523,0.0001382766,0.00005722608,0.0003059428,0.00001201671,0.002190615,0.0001429262,0.001776647,0.9208453,0.07380312,0.0001663862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2020443,0.01247467,0.759464,0.006658462,0.001161197,0.002358495,0.001322343,0.0001261279,0.01439042],"genre_scores_gemma":[0.8879237,0.0008374506,0.08687358,0.0002547982,0.0002593143,0.0004463726,0.00001653424,0.00007256667,0.02331565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6858794,"threshold_uncertainty_score":0.6110945,"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."}}