Evaluating Sampling Techniques for Large Dynamic Graphs

@inproceedings{Rasti2008EvaluatingST,
  title={Evaluating Sampling Techniques for Large Dynamic Graphs},
  author={Amir H. Rasti and Mojtaba Torkjazi and Reza Rejaie and Nick G. Duffield and Walter Willinger},
  year={2008}
}
In this section, we examine how the connectivity structure of the graph affects the efficiency of the RDS and MRW sampling techniques. Toward this end, we simulate both RDS and MRW techniques over several types of synthetic graph structures as well as one real graph. Note that we do not consider any of the synthetic graphs to be appropriate models of actual P2P systems or OSNs, but we use them in our experiments as examples for which we know the ground truth. At the same time, our choice of the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Scale-free and Hierarchical Structures in 12Our data collection was stopped since Friendster disabled our application key after a few days

  • A.-L. Barabasi, Z. Dezso, E. Ravasz, S.-H. Yook, Z. Oltvai
  • Complex Networks. In Seventh Granada Lectures,
  • 2002
Highly Influential
5 Excerpts

Gnutella Web Caching System: Version 2 Specifications Client Developers

  • H. Dämpfling
  • Guide. http://www.gnucleus.com/gwebcache/newgwc…
  • 2003
1 Excerpt

Six Degrees

  • D. J. Watts
  • In The Essence of a Connected Edge. ACM Press,
  • 2003
1 Excerpt

Gribble . King : Estimating Latency between Arbitrary Internet End Hosts

  • S. Saroiu, D. S.
  • Gnutella Web Caching System : Version 2…

Similar Papers

Loading similar papers…