跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要直接研究有向网络中的互惠效应、环计数和节点度异质性,属于网络建模方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Qunqiang Feng
Jiashun Jin
Yaru Tian
Ting Yan

有向网络互惠效应的最优估计与检验

研究问题
在有向网络的 p₁ 模型中,如何克服非线性因素对互惠效应估计的影响,并在不同稀疏程度和节点度异质性下进行有效检验?
方法与思路
作者选择两类长度相同的广义环,使其期望计数之比抵消模型中的非线性因素,再据此构造互惠参数估计量与检验统计量。
材料陈述的贡献
摘要称,所构造估计量在研究设定下达到最优收敛速率,检验达到最优相变边界,并分析了满足抵消关系的广义环对的存在性。
阅读关注点
阅读时应核对广义环对的选择规则、期望计数比的抵消条件,以及稀疏程度、节点度异质性如何进入最优性结论和统计量分析。
阅读边界
仅据所给 OpenAlex 版本摘要;具体参数范围、最优性基准和有限样本表现未说明,不能据此推断刊本变化或对任意网络的适用性。

原文摘要

The $p_1$ model plays a fundamental role in modeling directed networks, where the reciprocal effect parameter $ρ$ is of special interest in practice. However, due to nonlinear factors in this model, how to estimate $ρ$ efficiently is a long-standing open problem. We tackle the problem by the cycle count approach. The challenge is, due to the nonlinear factors in the model, for any given type of generalized cycles, the expected count is a complicated function of many parameters in the model, so it is unclear how to use cycle counts to estimate $ρ$. However, somewhat surprisingly, we discover that, among many types of generalized cycles with the same length, we can carefully pick a pair of them such that in the ratio between the expected cycle counts of the two types, the non-linear factors cancel out nicely with each other, and as a result, the ratio equals to $\mathrm{exp}(ρ)$ exactly. Therefore, though the expected count of cycles of any type is not tractable, the ratio between the expected cycle counts of a (carefully chosen) pair of generalized cycles may have an utterly simple form. We study to what extent such pairs exist, and use our discovery to derive both an estimate for $ρ$ and a testing procedure for testing $ρ= ρ_0$. In a setting where we allow a wide range of reciprocal effects and a wide variety of network sparsity and degree heterogeneity, we show that our estimator achieves the optimal rate and our test achieves the optimal phase transition. Technically, first, motivated by what we observe on real networks, we do not want to impose strong conditions on reciprocal effects, network sparsity, and degree heterogeneity. Second, our proposed statistic is a type of $U$-statistic, the analysis of which involves complex combinatorics and is error-prone. For these reasons, our analysis is long and delicate.

笔记与分组