475 citations · 1.1k across the 41 of their papers we have counts for
11 papers · 1 filter
Sampling Online Social Networks by Random Walk with Indirect Jumps
Junzhou Zhao, Pinghui Wang, John C. S. Lui +2
Random walk-based sampling methods are gaining popularity and importance in characterizing large networks. While powerful, they suffer from the slow mixing problem when the graph i…
A Fast Sampling Method of Exploring Graphlet Degrees of Large Directed and Undirected Graphs
Pinghui Wang, Xiangliang Zhang, Zhenguo Li +6
Exploring small connected and induced subgraph patterns (CIS patterns, or graphlets) has recently attracted considerable attention. Despite recent efforts on computing the number o…
Moss: A Scalable Tool for Efficiently Sampling and Counting 4- and 5-Node Graphlets
Pinghui Wang, Jing Tao, Junzhou Zhao +1
Counting the frequencies of 3-, 4-, and 5-node undirected motifs (also know as graphlets) is widely used for understanding complex networks such as social and biology networks. How…
A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph
Xiaoming Liu, Yadong Zhou, Xiaohong Guan
Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications,…
Tracking Triadic Cardinality Distributions for Burst Detection in Social Activity Streams
Junzhou Zhao, John C. S. Lui, Don Towsley +2
In everyday life, we often observe unusually frequent interactions among people before or during important events, e.g., we receive/send more greetings from/to our friends on Chris…
Design of Efficient Sampling Methods on Hybrid Social-Affiliation Networks
Junzhou Zhao, John C. S. Lui, Don Towsley +2
Graph sampling via crawling has become increasingly popular and important in the study of measuring various characteristics of large scale complex networks. While powerful, it is k…