1 citations · 1 across the 5 of their papers we have counts for
7 papers
Counting Triangles in Graph Streams with Repeatable and Forgettable Edges
Sourav Chakraborty, Debarshi Chanda, Arijit Ghosh +3
Most existing graph streaming algorithms assume the ideal scenario where each edge arrives only once. Real-world graph streams, such as communication or transaction logs, often con…
Unlocking Fractional Moments in Delphic Set Streams
Aranya Kumar Bal, Sourav Chakraborty, Arijit Ghosh +1
We consider estimation of non-integer frequency moments and related Bernstein-type statistics in the Delphic set stream model under a bounded-frequency assumption: every univ…
From Decision to Random Certificates: Exponential Separation for Edge Estimation with Independent Set Queries
Debarshi Chanda, Buddha Dev Das, Arijit Ghosh +1
We study the problem of estimating the number of edges in an undirected, unweighted graph using sublinear query access. We consider a query model that preserves the structure of In…
Dimension Agnostic Testing of Survey Data Credibility through the Lens of Regression
Debabrota Basu, Sourav Chakraborty, Debarshi Chanda +3
Assessing whether a sample survey credibly represents the population is a critical question for ensuring the validity of downstream research. Generally, this problem reduces to est…
Testing vs Estimation for Index-Invariant Properties in the Huge Object Model
Sourav Chakraborty, Eldar Fischer, Arijit Ghosh +3
The Huge Object model of property testing [Goldreich and Ron, TheoretiCS 23] concerns properties of distributions supported on , where is so large that even reading…
Testing Credibility of Public and Private Surveys through the Lens of Regression
Debabrota Basu, Sourav Chakraborty, Debarshi Chanda +3
Testing whether a sample survey is a credible representation of the population is an important question to ensure the validity of any downstream research. While this problem, in ge…
Structure of sparse Boolean functions over Abelian groups, and its application to testing
Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta +2
We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function is -sparse if it has at most non-zero Fourier coeffici…