69 citations · 175 across the 40 of their papers we have counts for
7 papers · 1 filter
Network Robustness via Global k-cores
Palash Dey, Suman Kalyan Maity, Sourav Medya +1
Network robustness is a measure a network's ability to survive adversarial attacks. But not all parts of a network are equal. K-cores, which are dense subgraphs, are known to captu…
Balance Maximization in Signed Networks via Edge Deletions
Kartik Sharma, Iqra Altaf Gillani, Sourav Medya +2
In signed networks, each edge is labeled as either positive or negative. The edge sign captures the polarity of a relationship. Balance of signed networks is a well-studied propert…
Manipulating Node Similarity Measures in Networks
Palash Dey, Sourav Medya
Node similarity measures quantify how similar a pair of nodes are in a network. These similarity measures turn out to be an important fundamental tool for many real world applicati…
Covert Networks: How Hard is It to Hide?
Palash Dey, Sourav Medya
Covert networks are social networks that often consist of harmful users. Social Network Analysis (SNA) has played an important role in reducing criminal activities (e.g., counter t…
Influence Minimization Under Budget and Matroid Constraints: Extended Version
Sourav Medya, Arlei Silva, Ambuj Singh
Recently, online social networks have become major battlegrounds for political campaigns, viral marketing, and the dissemination of news. As a consequence, ''bad actors'' are incre…
K-Core Minimization: A Game Theoretic Approach
Sourav Medya, Tiyani Ma, Arlei Silva +1
K-cores are maximal induced subgraphs where all vertices have degree at least k. These dense patterns have applications in community detection, network visualization and protein fu…
Maximizing Coverage Centrality via Network Design: Extended Version
Sourav Medya, Arlei Silva, Ambuj Singh +2
Network centrality plays an important role in many applications. Central nodes in social networks can be influential, driving opinions and spreading news or rumors.In hyperlinked e…