Extreme Value methods for networks

当网络发展时，节点的极端行为是什么？我们想要检查节点中心性度量的极值的分布之间是否存在对应关系，例如入/出度，以及网络的增长规则。我们对网络(及其变体)的偏好依恋模型特别感兴趣，因为该模型似乎适合于现实生活中的网络的度极值用极值方法更好地拟合。我们还将把理论和方法推广到其他类型的网络。

When a network grows, what is the extremal behaviour of the nodes? We would like to examine if there a correspondence between the distribution of the extremes of the node centrality measures, such as in-/out-degrees, and the growth rules of the networks. We are particularly interested in the preferential attachment model for networks (and variants thereof), as the degree extremes of real-life networks that the model seems suitable for are better fitted by extreme value methods. We will also extend the theory and methods to other kinds of networks.