most citedAlgorithmic Design for Competitive Influence Maximization Problems

3 citations · 4 across the 6 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

cs.SI2014

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…

cs.SI2014★ 3 cited

Algorithmic Design for Competitive Influence Maximization Problems

Yishi Lin, John C. S. Lui

Given the popularity of the viral marketing campaign in online social networks, finding an effective method to identify a set of most influential nodes so to compete well with othe…

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…

cs.PF2014★ 1 cited

Block-Structured Supermarket Models

Quan-Lin Li, John C. S. Lui

Supermarket models are a class of parallel queueing networks with an adaptive control scheme that play a key role in the study of resource management of, such as, computer networks…

cs.SI2014

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…