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 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.
Type de document :
Communication dans un congrès
3rd International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2014), Nov 2014, Marrakech, Morocco. pp.331-338, 〈http://www.complexnetworks.org/index.html〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01094259
Contributeur : Jithin Sreedharan <>
Soumis le : jeudi 11 décembre 2014 - 23:03:12
Dernière modification le : samedi 27 janvier 2018 - 01:31:41

Identifiants

  • HAL Id : hal-01094259, version 1

Collections

Citation

Konstantin Avrachenkov, Natalia M. Markovich, Jithin K. Sreedharan. Distribution and Dependence of Extremes in Network Sampling Processes. 3rd International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2014), Nov 2014, Marrakech, Morocco. pp.331-338, 〈http://www.complexnetworks.org/index.html〉. 〈hal-01094259〉

Partager

Métriques

Consultations de la notice

139