The Bootstrap for Network Dependent Processes
网络依赖过程的自助法AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确针对网络依赖过程构造置信集、自助法及网络 HAC 方差估计。
网络依赖过程的自助法AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This paper focuses on the bootstrap for network dependent processes under the conditional $ψ$-weak dependence. Such processes are distinct from other forms of random fields studied in the statistics and econometrics literature so that the existing bootstrap methods cannot be applied directly. We propose a block-based approach and a modification of the dependent wild bootstrap for constructing confidence sets for the mean of a network dependent process. In addition, we establish the consistency of these methods for the smooth function model and provide the bootstrap alternatives to the network heteroskedasticity-autocorrelation consistent (HAC) variance estimator. We find that the modified dependent wild bootstrap and the corresponding variance estimator are consistent under weaker conditions relative to the block-based method, which makes the former approach preferable for practical implementation.
空间混杂与干扰下直接因果效应估计的统一框架及 R 包 spaci
Estimating causal effects is challenging with observational data due to the lack of exchangeability, and is further complicated with spatial data. In real-life applications such as agricultural and environmental studies, unobserved spatial factors (spatial confounding, SC) and interactions of units in nearby locations (spatial interference, SI) commonly occur jointly, yet existing parametric methods address them separately. We develop a unified framework that treats both…
复杂(准)实验设计下的简单标准误
We develop standard errors for estimates of causal effects in settings where the distribution of treatment exposures is known but potentially exhibits complicated dependence patterns across units. Such dependence arises, for example, in settings with spillovers/interference across units or when the treatment assignment is spatially correlated. Our variance estimator generalizes several properties of the Neyman variance estimator for completely randomized experiments to…
We develop inference for complete dyadic samples with spatial dependence governed by geographic distances between nodes, covering settings beyond the scope of existing dyadic inference theory. We propose spatial variance and corrected block jackknife estimators consistent in nondegenerate and degenerate Gaussian cases. Under degeneracy, spatial subsampling consistently estimates possibly non-Gaussian limits. Combining the jackknife with subsampling yields the max…
双侧随机化设计中的因果推断:析因回归、双向聚类与协变量调整
We study randomized experiments involving two interacting populations, such as buyers and sellers in a marketplace. In the two-sided experiments we consider, we randomize the two populations separately and independently. For a pair consisting of one member from each population, the two assignments jointly determine one of four exposure conditions. Under a local interference assumption, we consider a broad class of linear estimands, including total, interaction, and buyer-…
非可分双边关系回归
This paper studies a nonseparable model for dyadic outcomes, such as bilateral trade flows, in which the outcome depends on both agents' characteristics and on a scalar unobservable through an unknown function increasing in that unobservable. I establish identification of a normalized structural function and the error distribution, propose kernel plug-in estimators, and derive a two-regime central limit theory under dyadic dependence in which a shared-agent variance…
高维网络数据的统计推断
We develop a novel method of inference for network-dependent high-dimensional random vectors. Dependence is characterized via a functional dependence measure based on graph distance, allowing the approximation theory to capture the interaction between the decay of dependence and the growth of network neighborhoods. We establish Gaussian approximation results for the maximum norm under finite-moment and sub-Weibull conditions, providing explicit conditions under which the…