6 citations · 17 across the 10 of their papers we have counts for
10 papers
CoreSPECT: Enhancing Clustering Algorithms via an Interplay of Density and Geometry
Chandra Sekhar Mukherjee, Joonyoung Bae, Jiapeng Zhang
In this paper, we provide a novel perspective on the underlying structure of real-world data with ground-truth clusters via characterization of an abundantly observed yet often ove…
A multi-core periphery perspective: Ranking via relative centrality
Chandra Sekhar Mukherjee, Jiapeng Zhang
Community and core-periphery are two widely studied graph structures, with their coexistence observed in real-world graphs (Rombach, Porter, Fowler \& Mucha [SIAM J. App. Math. 201…
Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms
Chandra Sekhar Mukherjee, Jiapeng Zhang
Community detection in the stochastic block model is one of the central problems of graph clustering. Since its introduction, many subsequent papers have made great strides in solv…
Capturing the Denoising Effect of PCA via Compression Ratio
Chandra Sekhar Mukherjee, Nikhil Doerkar, Jiapeng Zhang
Principal component analysis (PCA) is one of the most fundamental tools in machine learning with broad use as a dimensionality reduction and denoising tool. In the later setting, w…
Recovering Unbalanced Communities in the Stochastic Block Model With Application to Clustering with a Faulty Oracle
Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang
The stochastic block model (SBM) is a fundamental model for studying graph clustering or community detection in networks. It has received great attention in the last decade and the…
On Boolean Functions with Low Polynomial Degree and Higher Order Sensitivity
Subhamoy Maitra, Chandra Sekhar Mukherjee, Pantelimon Stanica +1
Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theo…
Following Forrelation -- Quantum Algorithms in Exploring Boolean Functions' Spectra
Suman Dutta, Subhamoy Maitra, Chandra Sekhar Mukherjee
Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al, 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean f…
Exact Quantum Query Algorithms Outperforming Parity -- Beyond The Symmetric functions
Chandra Sekhar Mukherjee, Subhamoy Maitra
In Exact Quantum Query model, almost all of the Boolean functions for which non-trivial query algorithms exist are symmetric in nature. The most well known techniques in this domai…
On Actual Preparation of Dicke State on a Quantum Computer
Chandra Sekhar Mukherjee, Subhamoy Maitra, Vineet Gaurav +1
The exact number of CNOT and single qubit gates needed to implement a Quantum Algorithm in a given architecture is one of the central problems of Quantum Computation. In this work…
Classical-Quantum Separations in Certain Classes of Boolean Functions-- Analysis using the Parity Decision Trees
Chandra Sekhar Mukherjee, Subhamoy Maitra
In this paper we study the separation between the deterministic (classical) query complexity () and the exact quantum query complexity () of several Boolean function classe…