Distribution and Dependence of Extremes in Network Sampling Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computational Social Networks Year : 2015

Distribution and Dependence of Extremes in Network Sampling Processes


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.
Fichier principal
Vignette du fichier
s40649-015-0018-3.pdf (1.02 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01259001 , version 1 (19-01-2016)



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


61 View
107 Download



Gmail Facebook Twitter LinkedIn More