Analysis of Networks via the Sparse β -model
利用稀疏 β 模型分析网络AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确提出稀疏网络模型、节点参数选择,并以小额信贷参与网络为例,直接对应网络方向。
利用稀疏 β 模型分析网络AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Abstract Data in the form of networks are increasingly available in a variety of areas, yet statistical models allowing for parameter estimates with desirable statistical properties for sparse networks remain scarce. To address this, we propose the Sparse β-Model (SβM), a new network model that interpolates the celebrated Erdős–Rényi model and the β-model that assigns one different parameter to each node. By a novel reparameterization of the β-model to distinguish global and local parameters, our SβM can drastically reduce the dimensionality of the β-model by requiring some of the local parameters to be zero. We derive the asymptotic distribution of the maximum likelihood estimator of the SβM when the support of the parameter vector is known. When the support is unknown, we formulate a penalized likelihood approach with the ℓ0-penalty. Remarkably, we show via a monotonicity lemma that the seemingly combinatorial computational problem due to the ℓ0-penalty can be overcome by assigning non-zero parameters to those nodes with the largest degrees. We further show that a β-min condition guarantees our method to identify the true model and provide excess risk bounds for the estimated parameters. The estimation procedure enjoys good finite sample properties as shown by simulation studies. The usefulness of the SβM is further illustrated via the analysis of a microfinance take-up example.