6 papers
Differentially Private and Scalable Estimation of the Network Principal Component
Alireza Khayatian, Anil Vullikanti, Aritra Konar
Computing the principal component (PC) of the adjacency matrix of an undirected graph has several applications ranging from identifying key vertices for influence maximization and…
FairRARI: A Plug and Play Framework for Fairness-Aware PageRank
Emmanouil Kariotakis, Aritra Konar
PageRank (PR) is a fundamental algorithm in graph machine learning tasks. Owing to the increasing importance of algorithmic fairness, we consider the problem of computing PR vector…
On Densest -Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
Qiheng Lu, Nicholas D. Sidiropoulos, Aritra Konar
The Densest -Subgraph (DS) is a fundamental combinatorial problem known for its theoretical hardness and breadth of applications. Recently, Lu et al. (AAAI 2025) introduced a…
A Scalable and Exact Relaxation for Densest -Subgraph via Error Bounds
Ya Liu, Junbin Liu, Wing-Kin Ma +1
Given an undirected graph and a size parameter , the Densest -Subgraph (DS) problem extracts the subgraph on vertices with the largest number of induced edges. While D…
The Vertex-Attribute-Constrained Densest -Subgraph Problem
Qiheng Lu, Nicholas D. Sidiropoulos, Aritra Konar
Dense subgraph mining is a fundamental technique in graph mining, commonly applied in fraud detection, community detection, product recommendation, and document summarization. In s…
Fairness-Aware Dense Subgraph Discovery
Emmanouil Kariotakis, Nicholas D. Sidiropoulos, Aritra Konar
Dense subgraph discovery (DSD) is a key graph mining primitive with myriad applications including finding densely connected communities which are diverse in their vertex compositio…