Random walk on node cliques for high-quality samples to estimate large graphs with high accuracies and low costs

[1]  Junhuai Li,et al.  A Survey of Sampling Method for Social Media Embeddedness Relationship , 2022, ACM Comput. Surv..

[2]  Kazuyuki Shudo,et al.  Social Graph Restoration via Random Walk Sampling , 2021, 2022 IEEE 38th International Conference on Data Engineering (ICDE).

[3]  Ying Zhao,et al.  Evaluating Effects of Background Stories on Graph Perception , 2021, IEEE Transactions on Visualization and Computer Graphics.

[4]  Weiwen Liu,et al.  Self-Training Enhanced: Network Embedding and Overlapping Community Detection With Adversarial Learning , 2021, IEEE Transactions on Neural Networks and Learning Systems.

[5]  John C. S. Lui,et al.  A Bootstrapping Approach to Optimize Random Walk Based Statistical Estimation over Graphs , 2021, 2021 IEEE 37th International Conference on Data Engineering (ICDE).

[6]  Zhiguang Zhou,et al.  Preserving Minority Structures in Graph Sampling , 2020, IEEE Transactions on Visualization and Computer Graphics.

[7]  Valentina Y. Guleva,et al.  Diffusion Dynamics Prediction on Networks Using Sub-graph Motif Distribution , 2020, COMPLEX NETWORKS.

[8]  Dan Feng,et al.  DRaWS: A dual random-walk based sampling method to efficiently estimate distributions of degree and clique size over social networks , 2020, Knowl. Based Syst..

[9]  John C.S. Lui,et al.  Fast crawling methods of exploring content distributed over large graphs , 2019, Knowledge and Information Systems.

[10]  Donald F. Towsley,et al.  Sampling online social networks by random walk with indirect jumps , 2017, Data Mining and Knowledge Discovery.

[11]  John C.S. Lui,et al.  Practical characterization of large networks using neighborhood information , 2013, Knowledge and Information Systems.

[12]  Jing Tao,et al.  Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage , 2017, Proc. VLDB Endow..

[13]  Xin Xu,et al.  Challenging the limits: Sampling online social networks with cost constraints , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[14]  Ryan A. Rossi,et al.  On Sampling from Massive Graph Streams , 2017, Proc. VLDB Endow..

[15]  Silvio Lattanzi,et al.  On Sampling Nodes in a Network , 2016, WWW.

[16]  John C. S. Lui,et al.  A General Framework for Estimating Graphlet Statistics via Random Walk , 2016, Proc. VLDB Endow..

[17]  Lorenzo De Stefani,et al.  TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size , 2016, KDD.

[18]  Yongsub Lim,et al.  MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams , 2015, KDD.

[19]  Gautam Das,et al.  Leveraging History for Faster Sampling of Online Social Networks , 2015, Proc. VLDB Endow..

[20]  Jeffrey Xu Yu,et al.  On random walk based graph sampling , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[21]  Hong Cheng,et al.  Random-walk domination in large graphs , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[22]  M. Ng,et al.  On the limiting probability distribution of a transition probability tensor , 2014 .

[23]  Donald F. Towsley,et al.  Efficiently Estimating Motif Statistics of Large Networks , 2013, TKDD.

[24]  Rasmus Pagh,et al.  On the streaming complexity of computing local clustering coefficients , 2013, WSDM.

[25]  Seshadhri Comandur,et al.  A space efficient streaming algorithm for triangle counting using the birthday paradox , 2012, KDD.

[26]  Gautam Das,et al.  Faster random walks by rewiring online social networks on-the-fly , 2012, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[27]  Donald F. Towsley,et al.  On Set Size Distribution Estimation and the Characterization of Large Networks via Sampling , 2012, IEEE Journal on Selected Areas in Communications.

[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]  XuXin,et al.  Beyond random walk and metropolis-hastings samplers , 2012 .

[30]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[31]  Xin Xu,et al.  Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling , 2012, SIGMETRICS '12.

[32]  Donald F. Towsley,et al.  Sampling directed graphs with random walks , 2012, 2012 Proceedings IEEE INFOCOM.

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

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

[35]  M. Kurant,et al.  Walking on a graph with a magnifying glass: stratified sampling via weighted random walks , 2011, SIGMETRICS '11.

[36]  Minas Gjoka,et al.  Walking on a graph with a magnifying glass: stratified sampling via weighted random walks , 2011, PERV.

[37]  Donald F. Towsley,et al.  Improving Random Walk Estimation Accuracy with Uniform Restarts , 2010, WAW.

[38]  Aziz Mohaisen,et al.  Measuring the mixing time of social graphs , 2010, IMC '10.

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

[40]  Donald F. Towsley,et al.  Estimating and sampling graphs with multidimensional random walks , 2010, IMC '10.

[41]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[42]  Walter Willinger,et al.  On Unbiased Sampling for Unstructured Peer-to-Peer Networks , 2006, IEEE/ACM Transactions on Networking.

[43]  Michael K. Ng,et al.  Higher-order multivariate Markov chains and their applications , 2008 .

[44]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[45]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[46]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[47]  Janez Konc,et al.  An improved branch and bound algorithm for the maximum clique problem , 2007 .

[48]  Ming Zhong,et al.  Random walk based node sampling in self-organizing networks , 2006, OPSR.

[49]  Mohammad Ghodsi,et al.  New Streaming Algorithms for Counting Triangles in Graphs , 2005, COCOON.

[50]  Fang Chen,et al.  Lifting Markov chains to speed up mixing , 1999, STOC '99.

[51]  Peter Winkler,et al.  Efficient stopping rules for Markov chains , 1995, STOC '95.

[52]  Bradley P. Carlin,et al.  Markov Chain Monte Carlo conver-gence diagnostics: a comparative review , 1996 .

[53]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .