{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002710309,0.001292822,0.001197431,0.001951595,0.000704999,0.001235064,0.002074314,0.001521485,0.0008781073],"category_scores_gemma":[0.0150546,0.0007255794,0.001130041,0.001672715,0.001214884,0.002721655,0.001487151,0.001850768,0.0004234689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001070494,"about_ca_system_score_gemma":0.0009823298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004930281,"about_ca_topic_score_gemma":0.003665566,"domain_scores_codex":[0.9983574,0.0007934333,0.00007121504,0.0002981818,0.000387073,0.00009283375],"domain_scores_gemma":[0.992448,0.00586912,0.0006489774,0.0005042638,0.0004109586,0.0001186835],"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.00003897292,0.00005135221,0.001437652,0.00006860422,0.00009117604,0.00008194641,0.0001084851,0.8689044,0.001687499,0.07921667,0.0007888014,0.04752446],"study_design_scores_gemma":[0.000002337226,0.000009576369,0.00006542788,0.000003674071,0.000005165487,0.00002186121,0.000005437552,0.9854897,0.0001991598,0.01382878,0.0003631152,0.000005757919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002487144,0.00007332415,0.9970783,0.00004034649,0.00001459398,0.00001450413,0.00001622721,0.00007665517,0.0001988502],"genre_scores_gemma":[0.2339019,0.0008573569,0.7624357,0.0001490824,0.0001695817,0.0002363291,0.0002795449,0.0001463489,0.001823995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004930281,"threshold_uncertainty_score":0.01433367,"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."}}