In their recent work "Scale-free networks are rare", Broido and Clauset address the problem of the analysis of degree distributions in networks to classify them as scale-free at different strengths of "scale-freeness." Over the last two decades, a multitude of papers in network science have reported that the degree distributions in many real-world networks follow power laws. Such networks were then referred to as scale-free. However, due to a lack of a precise definition, the term has evolved to mean a range of different things, leading to confusion and contradictory claims regarding scale-freeness of a given network. Recognizing this problem, the authors of "Scale-free networks are rare" try to fix it. They attempt to develop a versatile and statistically principled approach to remove this scale-free ambiguity accumulated in network science literature. Although their paper presents a fair attempt to address this fundamental problem, we must bring attention to some important issues in it.

中文翻译：

---

网络度分布分析中的分类、假设检验和估计收敛问题

在他们最近的工作“无标度网络是罕见的”中，Brido 和 Clauset 解决了分析网络中度分布的问题，将它们分类为具有不同“无标度”强度的无标度网络。在过去的二十年中，大量网络科学论文报告称，许多现实世界网络中的度数分布遵循幂律。这种网络随后被称为无标度网络。然而，由于缺乏精确的定义，该术语已经演变为表示一系列不同的事物，导致关于给定网络的无标度的混淆和相互矛盾的主张。认识到这个问题，“无尺度网络很少见”的作者试图解决它。他们试图开发一种通用且有统计原理的方法来消除网络科学文献中积累的这种无标度歧义。尽管他们的论文提出了解决这个基本问题的公平尝试，但我们必须注意其中的一些重要问题。