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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:评论明确围绕网络增长、根节点、社区和多种网络结构展开,直接对应网络方向,但没有因果效应或干扰识别的证据。

反馈分类问题

Andrej Srakar’s contribution to the Discussion of ‘Root and community inference on the latent growth process of a network’ by Crane and Xu

Andrej Srakar 对《网络潜在增长过程的根节点与社区推断》的讨论评论

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Andrej Srakar

Andrej Srakar 对《网络潜在增长过程的根节点与社区推断》的讨论评论

研究问题
这篇讨论评论询问网络增长历史的根节点与社区推断,能否扩展到其他随机图模型、拓扑结构及更广泛的网络特征?
方法与思路
评论者从替代网络过程、拓扑与距离、贝叶斯先验和计算、时序网络等角度提出研究建议,未开展新的估计或证明。
材料陈述的贡献
材料的贡献是提出模型比较、贝叶斯渐近性质和网络类型扩展等未来方向,不能把这些建议写成已经完成的方法或结果。
阅读关注点
应分别核对被讨论主论文的实际结论和评论提出的开放问题,特别关注替代模型比较、采样器混合及拓扑扩展的可行性。
阅读边界
所给 OpenAlex 材料是讨论评论,不能冒充主论文摘要或新增理论成果;材料未说明稿件版本,所列扩展均属建议,不能推断已被实现。

原文摘要

Paper presented by Harry Crane and Min Xu develops a rather novel area of network archaeology, which builds on findings of network science, probability theory and (in Crane and Xu's article) Bayesian statistics. My comments are directed to possible extensions for future work in this promising area of research. Firstly, in terms of network stochastic processes (authors use a combination of preferential attachment and Erdős–Rényi models) paper does little to explain comparisons with possible alternatives. Briend et al. (2023) discuss network archaeology in a random recursive dags and Cooper–Frieze random networks contexts, and Brandenberger et al. (2022) in the more general context of Bienaymé–Galton–Watson trees. I wonder if topology of the studied network could be incorporated in more detail, for example in today often studied weak-topology context (for example in Gromov-weak or just general Skorokhod topologies). This would need different metric spaces and distance metrics where results for different types of random graphs and trees are wide and could be useful for the development of the area as well for its extensions of studying the asymptotic behaviour and estimation. Combination with graphon perspectives which authors mention in the introduction would also be interesting to explore, as well as addressing the possibilities noted by Brandenberger et al. of extensions to k-ary, Cayley, Motzkin and planted plane trees as well as branching stochastic processes in general. Secondly, it seems to go unexplained why the authors are using Bayesian approach. The Bayesian component in the article seems underexplored and many possibilities could be useful for future developments of the used priors as well as Gibbs sampling procedure (authors themselves mention mixing properties of the sampler). Extensions of the Bayesian part could go in the direction of intractable likelihood perspectives, computational improvements (say, using integrated nested Laplace approximation) or in the selection of priors (parametric, semiparametric, or nonparametric perspectives or even to empirical Bayes possibilities). Study of the Bayesian asymptotic properties here would be very interesting. Finally, I miss more explicit and broad connection to the study of temporal networks and network in general. Not only root vertex and communities could be discovered, but connection to cliques, islands, and homophily as well as many possible types of networks based on characteristics of their ties, such as affiliation, weighted, multi-relational, or multi-layer networks. Possibilities for future research in this area of network science could loom large. The following contributions were received in writing after the meeting:

笔记与分组