1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
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…