Rules of the Game: Exponential Random Graph Models of a Gang Homicide Network

被引:21
|
作者
Lewis, Kevin [1 ]
Papachristos, Andrew, V [2 ]
机构
[1] Univ Calif San Diego, Sociol, San Diego, CA USA
[2] Northwestern Univ, Dept Sociol, 1810 Chicago St, Evanston, IL 60208 USA
关键词
P-ASTERISK MODELS; SOCIAL NETWORKS; RECIPROCITY; ORGANIZATION; HIERARCHY; CONTAGION; DYNAMICS; VIOLENCE; FAMILY;
D O I
10.1093/sf/soz106
中图分类号
C91 [社会学];
学科分类号
030301 ; 1204 ;
摘要
Gang members frequently refer to street life as a "game" (or "The Game"): a social milieu in which status is lost or won by the way individuals and groups manage their reputations. Like other games, successfully participating in the street game may demand adherence to certain rules, such as the willingness to violently redress threats, the avoidance of "weak" behaviors, and the protection of one's allies. This paper draws on detailed police records of violent exchanges among gangs in Chicago to ascertain which rules of the game in fact contribute to the relative social standing of groups. Specifically, we use exponential random graph models to identify the underlying micro-arrangements among gangs that collectively generate macro-level patterns of homicide. Findings illuminate a large and diverse array of generative mechanisms based on gangs' attributes and structural positions. However, these mechanisms vary depending on which two gangs are at hand; provide evidence of a contested hierarchy with few intergroup alliances; and are surprisingly inconsistent over time. As all gangs engage in local and ongoing struggles for dominance-and as the rules constantly change-the street game is continually played but never truly won.
引用
收藏
页码:1829 / 1858
页数:30
相关论文
共 50 条
  • [41] Exponential Random Graph (p*) Models as a Method for Social Network Analysis in Communication Research
    Shumate, Michelle
    Palazzolo, Edward T.
    COMMUNICATION METHODS AND MEASURES, 2010, 4 (04) : 341 - 371
  • [42] Estimating Exponential Random Graph Models using Sampled Network Data via Graphon
    He, Ran
    Zheng, Tian
    PROCEEDINGS OF THE 2016 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING ASONAM 2016, 2016, : 112 - 119
  • [43] On the geometry of discrete exponential families with application to exponential random graph models
    Rinaldo, Alessandro
    Fienberg, Stephen E.
    Zhou, Yi
    ELECTRONIC JOURNAL OF STATISTICS, 2009, 3 : 446 - 484
  • [44] Corporate network formation in Kuwait: board interlocks network analysis using exponential random graph models
    Alebrahim, Ebrahim
    Alnahedh, Mishari
    CORPORATE GOVERNANCE-THE INTERNATIONAL JOURNAL OF BUSINESS IN SOCIETY, 2024, 24 (07): : 1638 - 1662
  • [45] Introducing exponential random graph models for visibility networks
    Brughmans, Tom
    Keay, Simon
    Earl, Graeme
    JOURNAL OF ARCHAEOLOGICAL SCIENCE, 2014, 49 : 442 - 454
  • [46] A cluster expansion approach to exponential random graph models
    Yin, Mei
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2012,
  • [47] Auxiliary Parameter MCMC for Exponential Random Graph Models
    Byshkin, Maksym
    Stivala, Alex
    Mira, Antonietta
    Krause, Rolf
    Robins, Garry
    Lomi, Alessandro
    JOURNAL OF STATISTICAL PHYSICS, 2016, 165 (04) : 740 - 754
  • [48] Exponential random graph (p*) models for affiliation networks
    Wang, Peng
    Sharpe, Ken
    Robins, Garry L.
    Pattison, Philippa E.
    SOCIAL NETWORKS, 2009, 31 (01) : 12 - 25
  • [49] Scaling bias in pooled exponential random graph models
    Duxbury, Scott W.
    Wertsching, Jenna
    SOCIAL NETWORKS, 2023, 74 : 19 - 30
  • [50] A survey on exponential random graph models: an application perspective
    Ghafouri, Saeid
    Khasteh, Seyed Hossein
    PEERJ COMPUTER SCIENCE, 2020,