91 citations · 137 across the 22 of their papers we have counts for
8 papers · 1 filter
SaPHyRa: A Learning Theory Approach to Ranking Nodes in Large Networks
Phuc Thai, My T. Thai, Tam Vu +1
Ranking nodes based on their centrality stands a fundamental, yet, challenging problem in large-scale networks. Approximate methods can quickly estimate nodes' centrality and ident…
Auditing the Sensitivity of Graph-based Ranking with Visual Analytics
Tiankai Xie, Yuxin Ma, Hanghang Tong +2
Graph mining plays a pivotal role across a number of disciplines, and a variety of algorithms have been developed to answer who/what type questions. For example, what items shall w…
Approximate k-Cover in Hypergraphs: Efficient Algorithms, and Applications
Hung Nguyen, Phuc Thai, My Thai +2
Given a weighted hypergraph , the approximate -cover problem seeks for a size- subset of that has the maximum weighted cover…
Multiplex Influence Maximization in Online Social Networks with Heterogeneous Diffusion Models
Alan Kuhnle, Md Abdul Alim, Xiang Li +2
Motivated by online social networks that are linked together through overlapping users, we study the influence maximization problem on a multiplex, with each layer endowed with its…
Vulnerability of D2D Communications from Interconnected Social Networks
Tianyi Pan, Md Abdul Alim, Xiang Li +1
In this paper, we study how rumors in Online Social Networks (OSNs) may impact the performance of device-to-device (D2D) communication. As D2D is a new technology, people may choos…
Scalable Bicriteria Algorithms for the Threshold Activation Problem in Online Social Networks
Alan Kuhnle, Tianyi Pan, Md Abdul Alim +1
We consider the Threshold Activation Problem (TAP): given social network and positive threshold , find a minimum-size seed set that can trigger expected activation of at…