3 papers
cs.DS2026
Sublinear Algorithms for Estimating the Number of Hyperedges in Arbitrary Hypergraphs
Deeparnab Chakrabarty, Cooper LaPorte, C. Seshadhri
We study the problem of estimating the number of hyperedges in an arbitrary -vertex hypergraph using sublinear in queries. Note that the number of hyperedges, , can be ex…
cs.DS2026
Counting hypertriangles through hypergraph orientations
Daniel Paul-Pena, Vaishali Surianarayanan, Deeparnab Chakrabarty +1
Counting the number of small patterns is a central task in network analysis. While this problem is well studied for graphs, many real-world datasets are naturally modeled as hyperg…
cs.DS2025
Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries
Lorenzo Beretta, Deeparnab Chakrabarty, C. Seshadhri
We revisit the problem of designing sublinear algorithms for estimating the average degree of an -vertex graph. The standard access model for graphs allows for the following que…