Cited By
View all- Kannan SMathieu CZhou H(2018)Graph Reconstruction and VerificationACM Transactions on Algorithms10.1145/319960614:4(1-30)Online publication date: 9-Aug-2018
Efficient measurement of complex networks using link queries
Pages 254 - 259
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 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.
References
[1]
B. Wellman, "The network is personal: Introduction to a special issue of social networks," Social Networks, vol. 29, no. 3, pp. 349-356, July 2007.
[2]
M. Bouvel, V. Grebinski, and G. Kucherov, "Combinatorial search on graphs motivated by bioinformatics applicatitons: a brief survey," in Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, ser. Lecture Notes in Computer Science, D. Kratsch, Ed., vol. 3787. Springer Verlag, 2005, pp. 16-27.
[3]
N. Guelzim, S. Bottani, P. Bourgine, and F. Kepes, "Topological and causal structure of the yeast transcriptional regulatory network," Nature Genetics, vol. 31, no. 1, pp. 60-63, May 2002.
[4]
A. Lakhina, J. Byers, M. Crovella, and P. Xie, "Sampling biases in ip topology measurements," in IEEE Infocom, 2003.
[5]
D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, "On the bias of traceroute sampling," in ACM STOC, 2005.
[6]
J.-L. Guillaume and M. Latapy, "Relevance of massively distributed explorations of the internet topology: simulation results," in IEEE Infocom, 2005.
[7]
M. Latapy and C. Magnien, "Complex network measurements: Estimating the relevance of observed properties," in IEEE Infocom, 2008.
[8]
D. Stutzbach, R. Rejaie, N. G. Duffield, S. Sen, and W. Willinger, "Sampling techniques for large, dynamic graphs," in IEEE Infocom, 2006.
[9]
D. Stutzbach, R. Rejaie, N. G. Duffield, S. Sen, and W. Willinger, "On unbiased sampling for unstructured peer-to-peer networks," in IMC, 2006.
[10]
L. Dall'Asta, J. Alvarez-Hamelin, A. Barrat, A. Vazquez, and A. Vespignani, "A statistical approach to the traceroute-like exploration of networks: theory and simulations," in CAAN, 2004.
[11]
A. Clauset, C. Moore, and M. Newman, "Hierarchical structure and the prediction of missing links in networks," Nature, vol. 453, no. 7191, pp. 98-101, May 2008.
[12]
D. Liben-nowell and J. Kleinberg, "The link prediction problem for social networks," Journal of the American Society for Information Science and Technology, vol. 58, no. 7, pp. 1019-1031, 2007.
[13]
D. Watts and S. Strogatz, "Collective dynamics of small-world networks," Nature, vol. 393, 1998.
[14]
T. Schank and D. Wagner, "Finding, counting and listing all triangles in large graphs, an experimental study," in Workshop on Experimental and Efficient Algorithms (WEA), 2005.
[15]
T. Schank and D. Wagner, "Approximating clustering coefficient and transitivity," Journal of Graph Algorithms and Applications (JGAA), vol. 9:2, pp. 265-275, 2005.
[16]
C. Prieur, D. Cardon, J.-S. Beuscart, N. Pissard, and P. Pons, "The stength of weak cooperation: A case study on flickr," 2008, http://arxiv. org/abs/0802.2317.
Recommendations
Efficient measurement of round-trip link delays in software-defined networks
AbstractRound-trip link delay is an important indicator for network performance optimization and troubleshooting. The Software-Defined Networking (SDN) paradigm, which provides flexible and centralized control capability, paves the way for ...
On the Evolution of Finite-Sized Complex Networks with Constrained Link Addition
2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)Scale-free characteristics, where degree distribution of a network follows the power-law distribution, are observed in most of the existing real-world complex networks. Barabási and Albert first studied the evolution of random complex networks and ...
Real-Time Complex Object 3D Measurement
ICCMS '09: Proceedings of the 2009 International Conference on Computer Modeling and SimulationReal-Time complex object 3D measurement based on digital fringe projection has a huge potential for applications in many areas, including reverse engineering, inspection, entertainment and social security. We describe a real-time complex object 3D shape ...
Comments
Information & Contributors
Information
Published In
April 2009
418 pages
ISBN:9781424439683
Publisher
IEEE Press
Publication History
Published: 19 April 2009
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
Cited By
View all- Kannan SMathieu CZhou H(2018)Graph Reconstruction and VerificationACM Transactions on Algorithms10.1145/319960614:4(1-30)Online publication date: 9-Aug-2018
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in