网络的内在规模很小
The Intrinsic Scale of Networks is Small
摘要：
我们定义的内在规模，在网络开始揭示其身份的规模，在网络中的子图（由随机游走创建）是从类似的大小的子图在网络的扰动副本区分。我们对几种网络的内在规模进行了广泛的研究，从结构化（例如道路网络）到ad-hoc和非结构化（例如众包信息网络），再到生物网络。我们发现：（a）网络的内在规模非常小（7-20个顶点），尽管网络要大很多个数量级。(b)内在尺度量化了网络中的“结构”--明确为特定任务构建的网络具有较小的内在尺度。(c)不同尺度的结构可以是脆弱的（容易破坏）或坚固的。
英文摘要：
We define the intrinsic scale at which a network begins to reveal its identity as the scale at which subgraphs in the network (created by a random walk) are distinguishable from similar sized subgraphs in a perturbed copy of the network. We conduct an extensive study of intrinsic scale for several networks, ranging from structured (e.g. road networks) to ad-hoc and unstructured (e.g. crowd sourced information networks), to biological. We find: (a) The intrinsic scale is surprisingly small (7-20 vertices), even though the networks are many orders of magnitude larger. (b) The intrinsic scale quantifies ``structure'' in a network -- networks which are explicitly constructed for specific tasks have smaller intrinsic scale. (c) The structure at different scales can be fragile (easy to disrupt) or robust.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
