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.