Methods and Applications of Network Sampling

[1]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[2]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.

[3]  Mohammad Al Hasan,et al.  Graft: An Efficient Graphlet Counting Method for Large Graph Analysis , 2014, IEEE Transactions on Knowledge and Data Engineering.

[4]  Sebastian Wernicke,et al.  Efficient Detection of Network Motifs , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[5]  Matthew J. Salganik,et al.  5. Sampling and Estimation in Hidden Populations Using Respondent-Driven Sampling , 2004 .

[6]  Hans-Peter Kriegel,et al.  Metropolis Algorithms for Representative Subgraph Sampling , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[7]  Marc Najork,et al.  On near-uniform URL sampling , 2000, Comput. Networks.

[8]  Mark S Handcock,et al.  Estimating hidden population size using Respondent-Driven Sampling data. , 2012, Electronic journal of statistics.

[9]  Ramana Rao Kompella,et al.  Space-efficient sampling from social activity streams , 2012, BigMine '12.

[10]  Ramana Rao Kompella,et al.  Network Sampling Designs for Relational Classification , 2012, ICWSM.

[11]  Charalampos E. Tsourakakis.  Counting triangles in real-world networks using projections , 2011, Knowledge and Information Systems.

[12]  Ramana Rao Kompella,et al.  Network Sampling: From Static to Streaming Graphs , 2012, TKDD.

[13]  Jeffrey Scott Vitter,et al.  Random sampling with a reservoir , 1985, TOMS.

[14]  Douglas D. Heckathorn,et al.  Respondent-driven sampling : A new approach to the study of hidden populations , 1997 .

[15]  Tanya Y. Berger-Wolf,et al.  Sampling community structure , 2010, WWW '10.

[16]  Mohammad Al Hasan,et al.  FS3: A sampling based method for top-k frequent subgraph mining , 2014, 2014 IEEE International Conference on Big Data (Big Data).

[17]  Donald F. Towsley,et al.  On the estimation accuracy of degree distributions from graph sampling , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[18]  Mohammad Al Hasan,et al.  Finding Network Motifs Using MCMC Sampling , 2015, CompleNet.

[19]  Natasa Przulj,et al.  Biological network comparison using graphlet degree distribution , 2007, Bioinform..

[20]  Sebastian Wernicke,et al.  FANMOD: a tool for fast network motif detection , 2006, Bioinform..

[21]  Uri Alon,et al.  Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..

[22]  Dorothea Wagner,et al.  Approximating Clustering Coefficient and Transitivity , 2005, J. Graph Algorithms Appl..

[23]  Athina Markopoulou,et al.  Towards Unbiased BFS Sampling , 2011, IEEE Journal on Selected Areas in Communications.

[24]  Charalampos E. Tsourakakis,et al.  Colorful triangle counting and a MapReduce implementation , 2011, Inf. Process. Lett..

[25]  Minas Gjoka,et al.  Practical Recommendations on Crawling Online Social Networks , 2011, IEEE Journal on Selected Areas in Communications.

[26]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[27]  Christian Sohler,et al.  Counting triangles in data streams , 2006, PODS.

[28]  Mohammad Al Hasan,et al.  GUISE: Uniform Sampling of Graphlets for Large Graph Analysis , 2012, 2012 IEEE 12th International Conference on Data Mining.

[29]  Mohammad Al Hasan,et al.  GUISE: a uniform sampler for constructing frequency histogram of graphlets , 2013, Knowledge and Information Systems.

[30]  Kun-Lung Wu,et al.  Counting and Sampling Triangles from a Graph Stream , 2013, Proc. VLDB Endow..

[31]  Mohammad Al Hasan,et al.  Output Space Sampling for Graph Patterns , 2009, Proc. VLDB Endow..