In *Proc. 10th ACM SIGCOMM Conf. Internet Measurement (IMC '10)*, pages 390–403, Melbourne, 2010.

abstract bibtex

abstract bibtex

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 walks are useful but have drawbacks. Random vertex sampling may require too many resources (time, bandwidth, or money). Random walks, which normally require fewer resources per sample, can suffer from large estimation errors in the presence of disconnected or loosely connected graphs. In this work we propose a new m-dimensional random walk that uses m dependent random walkers. We show that the proposed sampling method, which we call Frontier sampling, exhibits all of the nice sampling properties of a regular random walk. At the same time, our simulations over large real world graphs show that, in the presence of disconnected or loosely connected components, Frontier sampling exhibits lower estimation errors than regular random walks. We also show that Frontier sampling is more suitable than random vertex sampling to sample the tail of the degree distribution of the graph.

@inproceedings{Ribeiro2010, abstract = {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 walks are useful but have drawbacks. Random vertex sampling may require too many resources (time, bandwidth, or money). Random walks, which normally require fewer resources per sample, can suffer from large estimation errors in the presence of disconnected or loosely connected graphs. In this work we propose a new m-dimensional random walk that uses m dependent random walkers. We show that the proposed sampling method, which we call Frontier sampling, exhibits all of the nice sampling properties of a regular random walk. At the same time, our simulations over large real world graphs show that, in the presence of disconnected or loosely connected components, Frontier sampling exhibits lower estimation errors than regular random walks. We also show that Frontier sampling is more suitable than random vertex sampling to sample the tail of the degree distribution of the graph.}, address = {Melbourne}, author = {Ribeiro, Bruno and Towsley, Don}, booktitle = {Proc. 10th ACM SIGCOMM Conf. Internet Measurement (IMC '10)}, file = {:home/ecem/Dropbox/mendeley\_sampling\_references/Ribeiro, Towsley/2010\_Ribeiro, Towsley\_Estimating and sampling graphs with multidimensional random walks.pdf:pdf}, keywords = {Estimating and Sampling Graphs with Multidimension,degree distribution,frontier sampling,graph sampling,random walk}, mendeley-tags = {degree distribution,frontier sampling,graph sampling,random walk}, pages = {390--403}, title = {{Estimating and Sampling Graphs with Multidimensional Random Walks}}, year = {2010} }

Downloads: 0