Sampling directed graphs with random walks
@article{Ribeiro2012SamplingDG, title={Sampling directed graphs with random walks}, author={Bruno Ribeiro and P. Wang and Fabricio Murai and D. Towsley}, journal={2012 Proceedings IEEE INFOCOM}, year={2012}, pages={1692-1700} }
Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools that can be used to characterize directed graphs in the wild, where no pre-processed data is available. The presence of hidden incoming edges but observable outgoing edges poses a challenge to characterize large directed graphs through crawling, as existing sampling methods cannot cope with hidden incoming links. The driving… CONTINUE READING
Figures, Tables, and Topics from this paper
72 Citations
Characterizing Directed and Undirected Networks via Multidimensional Walks with Jumps
- Computer Science, Physics
- ACM Trans. Knowl. Discov. Data
- 2019
- 4
- PDF
Sampling online social networks by random walk with indirect jumps
- Computer Science, Physics
- Data Mining and Knowledge Discovery
- 2018
- 9
- PDF
Design of Efficient Sampling Methods on Hybrid Social-Affiliation Networks
- Computer Science, Physics
- ArXiv
- 2014
- PDF
A tale of three graphs: Sampling design on hybrid social-affiliation networks
- Computer Science
- 2015 IEEE 31st International Conference on Data Engineering
- 2015
- 13
- PDF
Non-Markovian Monte Carlo on Directed Graphs
- Mathematics, Computer Science
- Proc. ACM Meas. Anal. Comput. Syst.
- 2019
- 4
- Highly Influenced
- PDF
Unbiased Characterization of Node Pairs over Large Graphs
- Computer Science, Mathematics
- ACM Trans. Knowl. Discov. Data
- 2015
- 6
- PDF
Practical characterization of large networks using neighborhood information
- Computer Science, Physics
- Knowledge and Information Systems
- 2018
- 6
- PDF
References
SHOWING 1-10 OF 23 REFERENCES
Multiple random walks to uncover short paths in power law networks
- Computer Science, Physics
- 2012 Proceedings IEEE INFOCOM Workshops
- 2012
- 8
- PDF
Estimating and sampling graphs with multidimensional random walks
- Computer Science, Mathematics
- IMC '10
- 2010
- 282
- PDF
Respondent-Driven Sampling for Characterizing Unstructured Overlays
- Computer Science
- IEEE INFOCOM 2009
- 2009
- 87
- PDF
Predicting positive and negative links in online social networks
- Psychology, Computer Science
- WWW '10
- 2010
- 1,298
- PDF
On MySpace Account Spans and Double Pareto-Like Distribution of Friends
- Mathematics
- 2010 INFOCOM IEEE Conference on Computer Communications Workshops
- 2010
- 26
- PDF
The Anatomy of a Large-Scale Hypertextual Web Search Engine
- Computer Science
- Comput. Networks
- 1998
- 14,726
- PDF