网络抽样过程中极值的分布与相依性
Distribution and Dependence of Extremes in Network Sampling Processes
摘要:
我们探讨了大型网络的采样序列中的依赖结构。我们考虑随机算法来采样的节点和研究极值性质在任何相关的平稳序列的感兴趣的特征,如节点度,追随者的数量或收入的节点在在线社交网络等,满足两个混合条件。研究了采样序列的几个有用的极值,如$k$ th最大值、超过阈值的聚类、大值的首次命中时间等。我们将极值的相关性和统计量抽象为极值理论中的一个参数,称为极值指数(EI)。在这项工作中,我们推导出这个参数的分析,也估计它的经验。我们建议使用EI作为一个参数,比较不同的采样程序。作为一个具体的例子,详细研究了相邻节点之间的度相关性与三个突出的随机游动作为采样技术。
英文摘要:
We explore the dependence structure in the sampled sequence of large networks. We consider randomized algorithms to sample the nodes and study extremal properties in any associated stationary sequence of characteristics of interest like node degrees, number of followers or income of the nodes in Online Social Networks etc, which satisfy two mixing conditions. Several useful extremes of the sampled sequence like $k$th largest value, clusters of exceedances over a threshold, first hitting time of a large value etc are investigated. We abstract the dependence and the statistics of extremes into a single parameter that appears in Extreme Value Theory, called extremal index (EI). In this work, we derive this parameter analytically and also estimate it empirically. We propose the use of EI as a parameter to compare different sampling procedures. As a specific example, degree correlations between neighboring nodes are studied in detail with three prominent random walks as sampling techniques.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。