Efficient Measurement of Complex Networks Using Link Queries - Archive ouverte HAL Access content directly
Conference Papers Year :

Efficient Measurement of Complex Networks Using Link Queries


Complex networks are at the core of an intense research activity. However, in most cases, intricate and costly measurement procedures are needed to explore their structure. In some cases, these measurements rely on link queries: given two nodes, it is possible to test the existence of a link between them. These tests may be costly, and thus minimizing their number while maximizing the number of discovered links is a key issue. This is a challenging task, though, as initially no information is known on the network. This paper studies this problem: we observe that properties classically observed on real-world complex networks give hints for their efficient measurement; we derive simple principles and several measurement strategies based on this, and experimentally evaluate their efficiency on real-world cases. In order to do so, we introduce methods to evaluate the efficiency of strategies. We also explore the bias that different measurement strategies may induce.
Fichier principal
Vignette du fichier
eff.pdf (699.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01217889 , version 1 (20-10-2015)



Fabien Tarissan, Matthieu Latapy, Christophe Prieur. Efficient Measurement of Complex Networks Using Link Queries. IEEE International Workshop on Network Science For Communication Networks (NetSciCom'09), Apr 2009, Rio de Janeiro, Brazil. pp.1-6, ⟨10.1109/INFCOMW.2009.5072135⟩. ⟨hal-01217889⟩
342 View
138 Download



Gmail Facebook Twitter LinkedIn More