Uniform random sampling not recommended for large graph size estimation-Reference-Cited by-同舟云学术

Uniform random sampling not recommended for large graph size estimation

Published:2017-12 Issue: Volume:421 Page:136-153
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Lu Jianguo,Wang Hao

Funder

NSERC

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference48 articles.

1. Improving random walk estimation accuracy with uniform restarts;Avrachenkov,2010

2. Random sampling from a search engine’s index;Bar-Yossef;J. ACM,2008

3. Emergence of scaling in random networks;Barabási;Science,1999

4. A technique for measuring the relative size and overlap of public web search engines;Bharat;Comput. Netw. ISDN Syst.,1998

5. On the robustness of centrality measures under conditions of imperfect data;Borgatti;Soc. Netw.,2006

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generic network sparsification via degree- and subgraph-based edge sampling;Information Sciences;2024-09

2. A Survey of Sampling Method for Social Media Embeddedness Relationship;ACM Computing Surveys;2022-11-21

3. Iterated multilevel simulated annealing for large-scale graph conductance minimization;Information Sciences;2021-09

4. Robust Size Estimation of Online Social Networks via Subgraph Sampling;IEEE Transactions on Network Science and Engineering;2020-10-01

5. Graph sampling for Internet topologies using normalized Laplacian spectral features;Information Sciences;2019-05