Ego Group Partition: A Novel Framework for Improving Ego Experiments in Social Networks

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Deng, Lu, Zhang, JingJing, Wang, Yong, Chen, Chuan
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909112204263424
author Deng, Lu
Zhang, JingJing
Wang, Yong
Chen, Chuan
author_facet Deng, Lu
Zhang, JingJing
Wang, Yong
Chen, Chuan
contents Estimating the average treatment effect in social networks is challenging due to individuals influencing each other. One approach to address interference is ego cluster experiments, where each cluster consists of a central individual (ego) and its peers (alters). Clusters are randomized, and only the effects on egos are measured. In this work, we propose an improved framework for ego cluster experiments called ego group partition (EGP), which directly generates two groups and an ego sub-population instead of ego clusters. Under specific model assumptions, we propose two ego group partition algorithms. Compared to the original ego clustering algorithm, our algorithms produce more egos, yield smaller biases, and support parallel computation. The performance of our algorithms is validated through simulation and real-world case studies.
format Preprint
id arxiv_https___arxiv_org_abs_2402_12655
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Ego Group Partition: A Novel Framework for Improving Ego Experiments in Social Networks
Deng, Lu
Zhang, JingJing
Wang, Yong
Chen, Chuan
Social and Information Networks
Applications
Estimating the average treatment effect in social networks is challenging due to individuals influencing each other. One approach to address interference is ego cluster experiments, where each cluster consists of a central individual (ego) and its peers (alters). Clusters are randomized, and only the effects on egos are measured. In this work, we propose an improved framework for ego cluster experiments called ego group partition (EGP), which directly generates two groups and an ego sub-population instead of ego clusters. Under specific model assumptions, we propose two ego group partition algorithms. Compared to the original ego clustering algorithm, our algorithms produce more egos, yield smaller biases, and support parallel computation. The performance of our algorithms is validated through simulation and real-world case studies.
title Ego Group Partition: A Novel Framework for Improving Ego Experiments in Social Networks
topic Social and Information Networks
Applications
url https://arxiv.org/abs/2402.12655