[1] Gui, Huan, Xu, Ya, Bhasin, Anmol, et al. Network A/B Testing: From Sampling to Estimation[C]// Proceedings of the 24th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 2015.
[2] Stumpf M P H, Carsten W, May R M. Subnets of scale-free networks are not scale-free: sampling properties of networks.[J]. Proceedings of the National Academy of Sciences of the United States of America, 2005, 102(12):págs. 4221-4224.
[3] Sang H, Lee, Pan-Jun, Kim, Hawoong, Jeong. Statistical properties of sampled networks[J]. Physical Review E, 2006, 73(1):-.
[4] Frank O. Survey sampling in graphs[J]. Journal of Statistical Planning & Inference, 1977, 1(3):235-264.
[5] Frank O. Sampling and Inference in a Population Graph[J]. International Statistical Review, 1980, 48(1):33-41.
[6] Frank O. A Survey of Statistical Methods for Graph Analysis[J]. Sociological Methodology, 1981:110-155.
[7] Friedman N. Lise Getoor, Daphne Koller and Avi Pfeffer, Learning Probabilistic Relational Models[J]. Proceedings of Ijcai, 1999.
[8] Krishnamurthy B. A measure of Online Social Networks[C]// Communication Systems and Networks and Workshops, 2009. COMSNETS 2009. First International. IEEE, 2009:1-10.
[9] Mislove A, Marcon M, Gummadi K P, et al. Measurement and Analysis of Online Social Networks[C]// Acm Sigcomm Conference on Internet Measurement, 2007:29-42.
[10] Mislove A, Koppula H S, Gummadi K P, et al. Growth of the flickr social network[J]. Wosn, 2008:25-30.
[11] Gile K J, Johnston L G, Salganik M J. Diagnostics for Respondent-driven Sampling[J]. Journal of the Royal Statistical Society, 2012, 178(1):241-269.
[12] Yong-Yeol A, Seungyeop H, Haewoon K, et al. Analysis of Topological Characteristics of Huge Online Social Networking Services[C]// In Proceedings of the 16th international conference on World Wide Web, 2007:835--844.
[13] Gjoka M, Kurant M, Butts C T, et al. Practical Recommendations on Crawling Online Social Networks[J]. Selected Areas in Communications IEEE Journal on, 2011, 29(9):1872-1892.
[14] Sang H, Lee, Pan-Jun, Kim, Hawoong, Jeong. Statistical properties of sampled networks[J]. Physical Review E, 2006, 73(1):-.
[15] Becchetti L, Castillo C, Donato D, et al. A Comparison of Sampling Techniques for Web Graph Characterization[J]. Linkkdd, 2006.
[16] Ye S, Lang J, Wu F. Crawling Online Social Graphs[C]// Web Conference (APWEB), 2010 12th International Asia-Pacific. IEEE, 2010:236 - 242.
[17] Park H, Moon S. Sampling bias in user attribute estimation of OSNs[C]// Proceedings of the 22nd international conference on World Wide Web companion. International World Wide Web Conferences Steering Committee, 2013:183-184.
[18] Kurant M, Markopoulou A, Thiran P. On the bias of BFS[C]// Teletraffic Congress (ITC), 2010 22nd International. IEEE, 2010:1 - 8.
[19] Asz L L. Random Walks on Graphs: A Survey[J]. Combinatorics, 1993, 8(4):1-46.
[20] Henzinger M R, Heydon A, Mitzenmacher M, et al. On near-uniform URL sampling[J]. Computer Networks, 2000, 33(16):295–308.
[21] Baykan E, Henzinger M, Keller S F, et al. A Comparison of Techniques for Sampling Web Pages[J]. Eprint Arxiv, 2009:13-30.
[22] Marion J Y, Schwentick T. Theoretical Aspects of Computer Science[J]. Theory of Computing Systems, 2012, 51(2):123-124.
[23] Gkantsidis C, Mihail M, Saberi A. Random walks in peer-to-peer networks: Algorithms and evaluation[J]. Performance Evaluation, 2006, 63(3):241–263.
[24] Leskovec J, Faloutsos C. Sampling from large graphs[C]// Acm Sigkdd International Conference on Knowledge Discovery & Data Mining. 2006:631-636.
[25] Rasti A H, Torkjazi M, Rejaie R, et al. Respondent-Driven Sampling for Characterizing Unstructured Overlays[C]// INFOCOM 2009, IEEE. IEEE, 2009:2701-2705.
[26] Stutzbach, Daniel, Rejaie, Reza, Duffield, Nick, et al. On unbiased sampling for unstructured peer-to-peer networks[C]// Proceedings of the 6th ACM SIGCOMM conference on Internet measurement. ACM, 2006:27-40.
[27] Salganik M J, Heckathorn D D. Sampling and Estimation in Hidden Populations Using Respondent‐Driven Sampling[J]. Sociological Methodology, 2004, 34(1):193-240.
[28] Volz E, Heckathorn D D. Probability based estimation theory for respondent driven sampling[J]. Journal of Official Statistics, 2008, 24(1):79-97.
[29] Metropolis N, Rosenbluth A W, Rosenbluth M N, et al. Equation of State Calculations by Fast Computing Machines[J]. Journal of Chemical Physics, 1953, 21(6):1087-1092.
[30] Gilks W R, Gilks W R, Gilks W R. Markov chain Monte Carlo in Practice[J]. International Encyclopedia of the Social & Behavioral Sciences, 1996, 2(4):9236–9240.
[31] Wang, Tianyi, Chen, Yang, Zhang, Zengbin, et al. Unbiased sampling in directed social graph[M]// ACM SIGCOMM Computer Communication Review. ACM, 2010:401-402.
[32] Ribeiro B, Wang P, Murai F, et al. Sampling directed graphs with random walks[C]// INFOCOM, 2012 Proceedings IEEE. IEEE, 2012:1692-1700.
[33] Gjoka M, Butts C T, Kurant M, et al. Multigraph Sampling of Online Social Networks[J]. Selected Areas in Communications IEEE Journal on, 2011, 29(9):1893 - 1905.
[34] Yang, Hu, Qi, Gao, Feng, Pan, et al. Complex network sampling based on particle swarm optimization[C]// Control Conference (CCC), 2015 34th Chinese. IEEE, 2015.
[35] Kurant M, Gjoka M, Butts C T, et al. Walking on a Graph with a Magnifying Glass[J]. Proc Acm Sigmetrics, 2011, 39(1).
[36] Shioda S. Random walk based biased sampling for data collection on communication networks[J]. Acm Sigmetrics Performance Evaluation Review, 2014, 42(2):21-23.
[37] Bastian M, Jacomy M, Heymann S. Gephi: An Open Source Software for Exploring and Manipulating Networks[C]// International AIII conference on web logs and social media, 2009.
[38] Kurant, Maciej, Gjoka, Minas, Wang, Yan, et al. Coarse-grained topology estimation via graph sampling[C]// Proceedings of the 2012 ACM workshop on Workshop on online social networks. ACM, 2012:25-30.
[39] Sugiyama K, Tagawa S, Toda M. Methods for Visual Understanding of Hierarchical System Structures[J]. Systems Man & Cybernetics IEEE Transactions on, 1981, 11(2):109-125.
[40] http:// www.visualcomplexity.com/vc.
[41] Eades P A. A Heuristic for Graph Drawing[J]. Congressus Numerantium, 1984, 42(42):149-160.
[42] Kamada T, Kawai S. An algorithm for drawing general undirected graphs[J]. Information Processing Letters, 1989, 31(89):7–15.
[43] Davidson R, Harel D. Drawing Graphs Nicely Using Simulated Annealing[J]. Acm Transactions on Graphics, 1996, 15(4):301-331.
[44] Fruchterman T M J, Reingold E M. Graph drawing by force‐directed placement[J]. Software Practice & Experience, 1991, 21(11):1129-1164.
[45] Frick A, Ludwig A, Mehldau H. A Fast Adaptive Layout Algorithm for Undirected Graphs[C]// Proceedings of the DIMACS International Workshop on Graph Drawing. Springer-Verlag, 1994:388-403.
[46] Harel D, Koren Y. A Fast Multi-scale Method for Drawing Large Graphs[M]// Graph Drawing. Springer Berlin Heidelberg, 2000:183-196.
[47] Harel D, Koren Y. Graph Drawing by High-Dimensional Embedding[J]. Journal of Graph Algorithms & Applications, 2002, 8(2):207--219.