CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Causal Inference under Network Interference Using a Mixture of Randomized Experiments
Authors
Yiming Jiang
He Wang
Publication date
31 August 2023
Publisher
View
on
arXiv
Abstract
In randomized experiments, the classic stable unit treatment value assumption (SUTVA) states that the outcome for one experimental unit does not depend on the treatment assigned to other units. However, the SUTVA assumption is often violated in applications such as online marketplaces and social networks where units interfere with each other. We consider the estimation of the average treatment effect in a network interference model using a mixed randomization design that combines two commonly used experimental methods: Bernoulli randomized design, where treatment is independently assigned for each individual unit, and cluster-based design, where treatment is assigned at an aggregate level. Essentially, a mixed randomization experiment runs these two designs simultaneously, allowing it to better measure the effect of network interference. We propose an unbiased estimator for the average treatment effect under the mixed design and show the variance of the estimator is bounded by
O
(
d
2
n
β
1
p
β
1
)
O({d^2}n^{-1}p^{-1})
O
(
d
2
n
β
1
p
β
1
)
where
d
d
d
is the maximum degree of the network,
n
n
n
is the network size, and
p
p
p
is the probability of treatment. We also establish a lower bound of
Ξ©
(
d
1.5
n
β
1
p
β
1
)
\Omega(d^{1.5}n^{-1}p^{-1})
Ξ©
(
d
1.5
n
β
1
p
β
1
)
for the variance of any mixed design. For a family of sparse networks characterized by a growth constant
ΞΊ
β€
d
\kappa \leq d
ΞΊ
β€
d
, we improve the upper bound to
O
(
ΞΊ
7
d
n
β
1
p
β
1
)
O({\kappa^7 d}n^{-1}p^{-1})
O
(
ΞΊ
7
d
n
β
1
p
β
1
)
. Furthermore, when interference weights on the edges of the network are unknown, we propose a weight-invariant design that achieves a variance bound of
O
(
d
3
n
β
1
p
β
1
)
O({d^3}n^{-1}p^{-1})
O
(
d
3
n
β
1
p
β
1
)
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:2309.00141
Last time updated on 12/09/2023