12 citations · 22 across the 13 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2016★ 12 cited
A General Framework for Estimating Graphlet Statistics via Random Walk
Xiaowei Chen, Yongkun Li, Pinghui Wang +1
Graphlets are induced subgraph patterns and have been frequently applied to characterize the local topology structures of graphs across various domains, e.g., online social network…
cs.SI2016★ 1 cited
Measuring and Maximizing Influence via Random Walk in Social Activity Networks
Pengpeng Zhao, Yongkun Li, Hong Xie +3
With the popularity of OSNs, finding a set of most influential users (or nodes) so as to trigger the largest influence cascade is of significance. For example, companies may take a…
cs.SI2014
Friends or Foes: Distributed and Randomized Algorithms to Determine Dishonest Recommenders in Online Social Networks
Yongkun Li, John C. S. Lui
Viral marketing is becoming important due to the popularity of online social networks (OSNs). Companies may provide incentives (e.g., via free samples of a product) to a small grou…