稀疏网络Beta中立向左模型的采样与推断
Sampling and Inference for Beta Neutral-to-the-Left Models of Sparse Networks
摘要:
经验证据表明,在许多真实网络中出现的重尾度分布可以很好地近似于幂律,其指数$η$可以取小于或大于2的值。基于各种形式的交换矩阵的模型能够捕获幂律与$η< 2$,并承认听话的推理算法,我们利用以前的结果表明,$η> 2$不能产生的形式,在现有的随机图模型中使用的交换矩阵。偏好依恋模型产生大于2的幂律指数,但由于在不可交换模型中执行推断的固有困难,因此作为统计模型的使用有限。出于这种差距,我们设计和实现推理算法,最近提出的一类模型,产生$η$的所有可能的值。我们发现,虽然它们是不可交换的,这些模型的概率结构服从推断。我们的方法使一大类以前棘手的模型有用的统计推断。
英文摘要:
Empirical evidence suggests that heavy-tailed degree distributions occurring in many real networks are well-approximated by power laws with exponents $η$ that may take values either less than and greater than two. Models based on various forms of exchangeability are able to capture power laws with $η< 2$, and admit tractable inference algorithms; we draw on previous results to show that $η> 2$ cannot be generated by the forms of exchangeability used in existing random graph models. Preferential attachment models generate power law exponents greater than two, but have been of limited use as statistical models due to the inherent difficulty of performing inference in non-exchangeable models. Motivated by this gap, we design and implement inference algorithms for a recently proposed class of models that generates $η$ of all possible values. We show that although they are not exchangeable, these models have probabilistic structure amenable to inference. Our methods make a large class of previously intractable models useful for statistical inference.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。