跳到正文
收录说明
收录范围
保留计量方法研究、相关统计基础,以及实质涉及计量方法的应用、教程、比较和综述。书评、刊务及明确无关内容不公开;身份或相关性证据不足的记录保留待核,补充可靠材料后可重新判断。
当前期刊来源见下方官网链接及期刊目录。综合经济学与金融期刊逐篇筛查计量方向,证据不足时暂不公开。正刊、在线优先论文和已核实接收稿合并展示;按标题、可靠摘要、目录及身份匹配的出版社 JEL 分类核验相关性;计量类 JEL 与摘要相互印证,无 JEL 不直接排除。历史回补以可取得的注册题录和目录为准,不等于覆盖全部纸本。
日期与排序
默认按最近发表排序:正刊使用刊期,待刊使用上线日期;缺少上线日期时,排序参考登记或首次收录时间,并在卡片注明。更多筛选可选择出版状态和日期口径;卷期依据出版社元数据,不因待刊时间较长而推定已编入正刊。仅有月份或年份时,日期区间相交也会纳入。

日期精度:到日 6 篇 · 到月 0 篇 · 到年 0 篇

分类与引用
领域和方法依据题名、摘要初步分类,可人工修正;分类不代表论文质量。引用数采用 OpenAlex 单条关联记录,不合计版本。
更新与 AI 解读
正常题录、可靠摘要与引用同步继续;日、周、月简报按核实的发表与修订日期汇总,历史补录保留在文献库。AI 解读依据可靠摘要或已核实原文片段,已有解读保留供阅读参考;缺少可靠材料的条目保持待解读,浏览页面不会触发生成。
6 篇论文
导出

Variational Nonparametric Inference in Stochastic Block Models with Functional Covariates

带函数型协变量的随机区块模型:变分非参数推断

We propose a functional stochastic block model whose vertices involve functional data information. This new model extends the classic stochastic block model with vector-valued nodal information, and finds applications in real-world networks whose nodal information could be functional curves. Examples include international trade data in which a network vertex (country) is associated with the annual or quarterly GDP over a certain time period, and MyFitnessPal data in which a…

AI 解读阅读原文 ↗BibTeX ↓

Design-Based Causal Inference with Missing Outcomes: Missingness Mechanisms, Imputation-Assisted Randomization Tests, and Covariate Adjustment

结局缺失下的设计型因果推断:缺失机制、插补辅助随机化检验与协变量调整

Design-based causal inference, also known as randomization-based or finite-population causal inference, is one of the most widely used causal inference frameworks, largely due to the merit that its validity can be guaranteed by study design (e.g., randomized experiments) and does not require assuming specific outcome-generating distributions or super-population models. Despite its advantages, design-based causal inference can still suffer from other issues, among which…

AI 解读阅读原文 ↗BibTeX ↓

Semiparametric modeling and analysis for longitudinal network data

纵向网络数据的半参数建模与分析

We introduce a semiparametric latent space model for analyzing longitudinal network data. The model consists of a static latent space component and a time-varying node-specific baseline component. We develop a semiparametric efficient score equation for the latent space parameter by adjusting for the baseline nuisance component. Estimation is accomplished through a one-step update estimator and an appropriately penalized maximum likelihood estimator. We derive oracle error…

AI 解读阅读原文 ↗BibTeX ↓

Yang Feng and Jiajin Sun’s contribution to the Discussion of ‘Root and community inference on the latent growth process of a network’ by Crane and Xu

Feng 与 Sun 对“网络潜在增长过程的根与社群推断”的讨论

We congratulate Drs. Crane and Xu for their fascinating piece of work. In the multiple roots PAPER model, one assumption is that different trees share the same affine preferential attachment (APA) growth parameters (α,β)⁠. In practice, the multiple trees in a network may have varying growth mechanisms, and it may be of interest to model each tree to have its own growth parameters. We consider such a heterogeneous affine preferential attachment (HAPA) model. Definition 1…

AI 解读阅读原文 ↗BibTeX ↓

PCABM: Pairwise Covariates-Adjusted Block Model for Community Detection

PCABM:用于社区检测的成对协变量调整块模型

One of the most fundamental problems in network study is community detection. The stochastic block model (SBM) is a widely used model, and various estimation methods have been developed with their community detection consistency results unveiled. However, the SBM is restricted by the strong assumption that all nodes in the same community are stochastically equivalent, which may not be suitable for practical applications. We introduce a pairwise covariates-adjusted stochastic…

AI 解读阅读原文 ↗BibTeX ↓

Testing community structure for hypergraphs

超图社群结构的检验

Many complex networks in the real world can be formulated as hypergraphs where community detection has been widely used. However, the fundamental question of whether communities exist or not in an observed hypergraph remains unclear. This work aims to tackle this important problem. Specifically, we systematically study when a hypergraph with community structure can be successfully distinguished from its Erdős–Rényi counterpart, and propose concrete test statistics when the…

AI 解读阅读原文 ↗BibTeX ↓