Andrew Wheeler, Sarah J. Mclean, Kelly Becker, Robert L. Worden
{"title":"Choosing Representatives to Deliver the Message in a Group Violence Intervention","authors":"Andrew Wheeler, Sarah J. Mclean, Kelly Becker, Robert L. Worden","doi":"10.2139/ssrn.2934325","DOIUrl":null,"url":null,"abstract":"Abstract The group-based violence intervention model is predicated on the assumption that individuals who hear credible messages of consequences for further violence will deliver the message to other group members. Using social network analysis, we develop an algorithm of who should receive the message to maximize the spread of the message among the remaining group members. Using a sample of gangs in four different cities we show how the reach of actual call-ins were suboptimal compared to our suggested algorithm. Using simulations, we further show that typically only around a third of the group needs to be delivered the message to achieve complete coverage of the network. We find that even when limiting possible invitees to those under supervision large proportions of groups can be reached if the invitee list is data driven.","PeriodicalId":41318,"journal":{"name":"Justice Evaluation Journal","volume":"43 1","pages":"117 - 93"},"PeriodicalIF":1.3000,"publicationDate":"2017-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Justice Evaluation Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.2934325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"CRIMINOLOGY & PENOLOGY","Score":null,"Total":0}
引用次数: 2
Abstract
Abstract The group-based violence intervention model is predicated on the assumption that individuals who hear credible messages of consequences for further violence will deliver the message to other group members. Using social network analysis, we develop an algorithm of who should receive the message to maximize the spread of the message among the remaining group members. Using a sample of gangs in four different cities we show how the reach of actual call-ins were suboptimal compared to our suggested algorithm. Using simulations, we further show that typically only around a third of the group needs to be delivered the message to achieve complete coverage of the network. We find that even when limiting possible invitees to those under supervision large proportions of groups can be reached if the invitee list is data driven.