2 papers
cs.IT2026
Query-Limited Community Recovery in Stochastic Block Models
Sabyasachi Basu, Manuj Mukherjee, Lutz Oettershagen +1
We study exact community recovery in the two-community stochastic block model on vertices under limited and noisy access to network data. The learner may query a noisy neighbor…
cs.DS2025
Aggregating maximal cliques in real-world graphs
Noga Alon, Sabyasachi Basu, Shweta Jain +3
Maximal clique enumeration is a fundamental graph mining task, but its utility is often limited by computational intractability and highly redundant output. To address these challe…