Skip to Main content Skip to Navigation
Journal articles

Distribution and Dependence of Extremes in Network Sampling Processes

Abstract : We explore the dependence structure in the sampled sequence of complex 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, which satisfy two mixing conditions. Several useful extremes of the sampled sequence like the kth largest value, clusters of exceedances over a threshold, and first hitting time of a large value 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Konstantin Avrachenkov <>
Submitted on : Tuesday, January 19, 2016 - 5:21:15 PM
Last modification on : Wednesday, October 14, 2020 - 3:57:38 AM
Long-term archiving on: : Friday, November 11, 2016 - 1:21:45 PM


Publisher files allowed on an open archive




Konstantin Avrachenkov, Natalia M. Markovich, Jithin K. Sreedharan. Distribution and Dependence of Extremes in Network Sampling Processes. Computational Social Networks, Springer, 2015, 2 (12), pp.1-21. ⟨10.1186/s40649-015-0018-3⟩. ⟨hal-01259001⟩



Record views


Files downloads