3 papers
cs.DS2019
A Fast Sketch Method for Mining User Similarities over Fully Dynamic Graph Streams
Peng Jia, Pinghui Wang, Jing Tao +1
Many real-world networks such as Twitter and YouTube are given as fully dynamic graph streams represented as sequences of edge insertions and deletions. (e.g., users can subscribe…
cs.DS2018
REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel
Pinghui Wang, Peng Jia, Yiyan Qi +3
Recently, considerable efforts have been devoted to approximately computing the global and local (i.e., incident to each node) triangle counts of a large graph stream represented a…
cs.DS2018
Utilizing Dynamic Properties of Sharing Bits and Registers to Estimate User Cardinalities over Time
Pinghui Wang, Peng Jia, Xiangliang Zhang +3
Online monitoring user cardinalities (or degrees) in graph streams is fundamental for many applications. For example in a bipartite graph representing user-website visiting activit…