Network-Constrained Matching and Randomization-Based Inference for Causal Effects
网络约束匹配与因果效应的随机化推断AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确结合因果匹配、随机化检验与网络邻近和依赖结构,直接支持因果推断及网络方向,但不能据此认定允许干扰。
网络约束匹配与因果效应的随机化推断AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Matching is widely used to mimic randomized experiments by forming matched sets in which treated and control units differ only randomly with respect to observed covariates. However, when the study population consists of interconnected units from a single network or a small number of networks, matching solely on observed covariates may produce matched units that are more closely connected in the network than would occur by chance. This increased network proximity within matched sets can induce spurious associations between treatment and outcome when both variables exhibit similar autocorrelation patterns on the network. To reduce spurious associations while preserving the validity of causal comparisons, we propose a new matching method that matches units with similar covariates subject to additional network-proximity constraints. For post-matching inference, we propose a randomization-based procedure for testing the sharp null hypothesis of no causal effect. The inference uses the asymptotic normal approximation and accommodates statistical dependence among test statistics obtained from each matched set without requiring explicit specifications of their correlation structures. We demonstrate the validity and utility of the proposed methods through simulation studies and apply them to the Framingham Heart Study. The matching method and subsequent inference procedure are implemented in the R package netmatchRI.