论文检索

动态网络形成的非参数推断：对“动态网络形成中的同质性与传递性”的评论AI 解读

1 IntroductionDano et al. (2026) develop a novel conditional logit approach to identify the structural parameters of a model of dynamic network formation. They propose a conditional maximum likelih...

存在跨簇干扰的整群随机试验AI 解读

The literature on cluster-randomized trials typically allows for interference within but not across clusters. This may be implausible when units are irregularly distributed across space without well-separated communities, as clusters in such cases may not align with significant geographic, social, or economic divisions. This paper develops methods for reducing bias due to cross-cluster interference. We first propose an estimation strategy that excludes units not surrounded…

网络聚类稳健推断AI 解读

Since network data commonly consists of observations from a single large network, researchers often partition the network into clusters in order to apply cluster‐robust inference methods. Existing such methods require clusters to be asymptotically independent. Under mild conditions, we prove that, for this requirement to hold for network‐dependent data, it is necessary and sufficient that clusters have low conductance, the ratio of edge boundary size to volume. This yields a…

空间干扰下速率最优的整群随机化设计AI 解读

We consider a potential outcomes model in which interference may be present between any two units but the extent of interference diminishes with spatial distance. The causal estimand is the global average treatment effect, which compares outcomes under the counterfactuals that all or no units are treated. We study a class of designs in which space is partitioned into clusters that are randomized into treatment and control. For each design, we estimate the treatment effect…

利用惩罚与 MCMC 的约束估计AI 解读

We study inference for parameters defined by either classical extremum estimators or Laplace-type estimators subject to general nonlinear constraints on the parameters. We show that running MCMC on the penalized version of the problem offers a computationally attractive alternative to solving the original constrained optimization problem. Bayesian credible intervals are asymptotically valid confidence intervals in a pointwise sense, providing exact asymptotic coverage for…

基于重抽样统计量的依赖稳健推断AI 解读

Summary We develop inference procedures robust to general forms of weak dependence. The procedures utilize test statistics constructed by resampling in a manner that does not depend on the unknown correlation structure of the data. We prove that the statistics are asymptotically normal under the weak requirement that the target parameter can be consistently estimated at the parametric rate. This holds for regular estimators under many well‐known forms of weak dependence and…

近似邻域干扰下的因果推断AI 解读

This paper studies causal inference in randomized experiments under network interference. Commonly used models of interference posit that treatments assigned to alters beyond a certain network distance from the ego have no effect on the ego's response. However, this assumption is violated in common models of social interactions. We propose a substantially weaker model of “approximate neighborhood interference” (ANI) under which treatments assigned to alters further from the…

网络干扰下的处理效应与溢出效应AI 解读

We study nonparametric and regression estimators of treatment and spillover effects when interference is mediated by a network. Inference is nonstandard due to dependence induced by treatment spillovers and network-correlated effects. We derive restrictions on the network degree distribution under which the estimators are consistent and asymptotically normal and show they can be verified under a strategic model of network formation. We also construct consistent variance…

两两稳定网络矩的弱大数定律AI 解读

This paper studies the dependence structure of sparse networks realized according to a strategic model of network formation with homophilous agents. We argue that equilibrium selection and chains of indirect dependence generated by strategic interactions are the main drivers of network dependence. Drawing on results in random-graph theory, we derive weak-dependence conditions under which a law of large numbers holds for a general class of network moments. A key condition…

不完全信息网络形成模型的两步估计AI 解读

We model network formation as a simultaneous game of incomplete information, allowing linking decisions to depend on the structure of the network as well as the attributes of agents. When the data is rationalized by a symmetric equilibrium, meaning observationally equivalent agents choose the same ex-ante strategies, the model can be estimated using a computationally simple two-step estimator. We derive its asymptotic properties under a sequence of models sending the number…