Distinguishing Homophily from Peer Influence Through Network Representation Learning

Xi Chen (), Yan Liu () and Cheng Zhang ()
Additional contact information
Xi Chen: Data Science and Engineering Management, School of Management, Zhejiang University, Hangzhou 310058, China; Center for Research on Zhejiang Digital Development and Governance, Hangzhou 310058, China
Yan Liu: Data Science and Engineering Management, School of Management, Zhejiang University, Hangzhou 310058, China
Cheng Zhang: Department of Information Management and Business Intelligence, School of Management, Fudan University, Shanghai 200433, China

INFORMS Journal on Computing, 2022, vol. 34, issue 4, 1958-1969

Abstract: Peer influence and homophily are two entangled forces underlying social influences. However, distinguishing homophily from peer influence is difficult, particularly when there is latent homophily caused by unobservable features. This paper proposes a novel data-driven framework that combines the advantages of latent homophily identification and causal inference. Specifically, the approach first utilizes scalable network representation learning algorithms to obtain node embeddings, which are extracted from social network structures. Then, the embeddings are used to control latent homophily in a quasi-experimental design for causal inference. The simulation experiments show that the proposed approach can estimate peer influence more accurately than existing parameterized approaches and data-driven methods. We applied the proposed framework in an empirical study of players’ online gaming behaviors. First, our approach can achieve improved model fitness for estimating peer influence in online games. Second, we discover a heterogeneous effect of peer influence: players with higher tenure and playing levels receive stronger peer influence. Finally, our results suggest that the homophily effect has a stronger influence on players’ behavior than peer influence. Summary of Contribution: The study proposes a novel computational method to separate peer influence from homophily in an online network. Using network embeddings learned from data to control latent homophily, the approach effectively addresses the challenge of correctly identifying peer effects in the absence of randomized experimental conditions. While simplifying the computational process, the method achieves good computational performance, thus effectively helping researchers and practitioners extract useful network information in various online service contexts.

Keywords: peer influence; homophily; network representation learning; quasi-experiment (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2022.1171 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:34:y:2022:i:4:p:1958-1969

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().