39 citations · 62 across the 8 of their papers we have counts for
5 papers · 1 filter
Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks
Junzhou Zhao, Shuo Shang, Pinghui Wang +2
Identifying influential nodes that can jointly trigger the maximum influence spread in networks is a fundamental problem in many applications such as viral marketing, online advert…
Tracking Triadic Cardinality Distributions for Burst Detection in High-Speed Multigraph Streams
Junzhou Zhao, Pinghui Wang, John C. S. Lui +2
In everyday life, we often observe unusually frequent interactions among people before or during important events, e.g., people send/receive more greetings to/from their friends on…
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…
Minfer: Inferring Motif Statistics From Sampled Edges
Pinghui Wang, John C. S. Lui, Don Towsley
Characterizing motif (i.e., locally connected subgraph patterns) statistics is important for understanding complex networks such as online social networks and communication network…