{"id":"W2097439479","doi":"10.1109/icassp.2012.6288560","title":"A novel use of stochastic approximation algorithms for estimating degree of each node in social networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Adjacency matrix; Markov chain; Degree distribution; Regular graph; Mathematics; Degree (music); Random graph; Random geometric graph; Graph; Discrete mathematics; Upper and lower bounds; Computer science; Algorithm; Combinatorics; Line graph; Voltage graph; Complex network; Statistics","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.0002608323,0.00009781045,0.0002652627,0.00008212549,0.00003954327,0.00001053428,0.00008244319,0.00003549153,0.00002471721],"category_scores_gemma":[0.00001087153,0.00009464671,0.0001129281,0.0002102218,0.00002894348,0.0001703821,0.00004751717,0.00007150185,1.979641e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001767498,"about_ca_system_score_gemma":0.00001257102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000359627,"about_ca_topic_score_gemma":0.00001066988,"domain_scores_codex":[0.9992065,0.00001754548,0.000365766,0.0001015355,0.000094689,0.0002140046],"domain_scores_gemma":[0.9993643,0.0001801259,0.0002387909,0.0001125052,0.00007967955,0.00002456383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008129526,0.001915007,0.06441653,0.0001390146,0.0003576835,3.326597e-8,0.001798149,0.3967797,0.003396012,0.1363941,0.001221143,0.3935013],"study_design_scores_gemma":[0.0002754818,0.00001285446,0.002489151,0.00002998891,0.00004326871,7.76115e-8,0.0000620403,0.9955217,0.0002729252,0.001196321,0.000006681878,0.0000895409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01973791,0.000007919464,0.9796904,0.000008192696,0.00002561686,0.0002720124,0.00001269766,0.00001864985,0.0002265497],"genre_scores_gemma":[0.6099563,2.114726e-8,0.3897275,0.000003152329,0.0002131848,0.00003919725,0.00004117902,0.00000808111,0.00001142199],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5987419,"threshold_uncertainty_score":0.3859581,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09357836979797461,"score_gpt":0.3238214127425483,"score_spread":0.2302430429445737,"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."}}