26 search results - page 1 / 6 » Coarse-Grained Topology Estimation via Graph Sampling |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
INFOCOM
2003
IEEE
13 years 9 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
WWW
2011
ACM
12 years 11 months ago
2011
ACM
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
ICASSP
2010
IEEE
13 years 4 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...