A weak law for moments of pairwise stable networks
两两稳定网络矩的弱大数定律AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究战略网络的依赖结构,并明确应用于网络干扰下的处理效应,支持网络与因果分类。
两两稳定网络矩的弱大数定律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 restricts the strength of strategic interactions, which constitutes the network analog of conventional weak-dependence assumptions in time series and spatial econometrics that bound the magnitude of autoregressive parameters. We apply our result to estimating models of strategic network formation and treatment effects under network interference.