创纪录的增长过程
A record-driven growth process
摘要:
我们引入了一个新的随机增长过程,记录驱动的增长过程,它起源于一类增长网络在一个普遍的限制制度的分析。节点被一个接一个地添加到网络中,每个节点具有一个质量。新的传入节点连接到具有最佳质量(即,具有质量的记录值)的预先存在的节点。涌现的结构是一个不断增长的网络,在这个网络中,群体围绕着记录节点(被赋予最佳内在品质的节点)形成。特别强调的是领导者(节点的程度是最大的)的统计。一个节点成为领导节点的渐近概率等于Golomb-Dickman常数Ω =0.624329.这在组合性质的问题中出现。这一结果解决了相关记录间间隔序列破纪录率的确定问题。该过程表现出时间的自相似性在晚时间制度。给出了与随机排列的圈的统计、随机破缺区间的统计性质和Kesten变量的关系。
英文摘要:
We introduce a novel stochastic growth process, the record-driven growth process, which originates from the analysis of a class of growing networks in a universal limiting regime. Nodes are added one by one to a network, each node possessing a quality. The new incoming node connects to the preexisting node with best quality, that is, with record value for the quality. The emergent structure is that of a growing network, where groups are formed around record nodes (nodes endowed with the best intrinsic qualities). Special emphasis is put on the statistics of leaders (nodes whose degrees are the largest). The asymptotic probability for a node to be a leader is equal to the Golomb-Dickman constant omega=0.624329... which arises in problems of combinatorical nature. This outcome solves the problem of the determination of the record breaking rate for the sequence of correlated inter-record intervals. The process exhibits temporal self-similarity in the late-time regime. Connections with the statistics of the cycles of random permutations, the statistical properties of randomly broken intervals, and the Kesten variable are given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。