Efficient Measurement of Complex Networks Using Link Queries

Abstract : 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.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01217889
Contributor : Fabien Tarissan <>
Submitted on : Tuesday, October 20, 2015 - 11:42:49 AM
Last modification on : Tuesday, May 14, 2019 - 10:12:33 AM
Long-term archiving on : Friday, April 28, 2017 - 7:20:38 AM

File

eff.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

575

Files downloads

177