Neeladri Maitra

activity

20212026

most citedScaling of the clustering function in spatial inhomogeneous random graphs

6 citations · 8 across the 13 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.ST2026

Estimating Community Boundaries in Geometric Random Graphs

Taha Ameen, Neeladri Maitra

The unit square $I = [0, 1]^{2}$ is divided into two rectangles by the vertical line $x = p$ , where $p \in (0, 1)$ . Consider $N$ independent uniformly distributed points on $I$ , which we int…

math.PR2026

Finding Adam in noisy trees

Luc Devroye, Gábor Lugosi, Neeladri Maitra

We consider the problem of finding the root vertex of a random uniform attachment tree, when the union of the unlabeled tree and an Erdős-Rényi random graph $G (n, p)$ is ob…

math.PR2026

Multipartite random graphs with given degrees: local limit, revisiting the giant, distances

Neeladri Maitra

We consider multipartite random graphs with given degree sequences, within and across different partitions. Under general assumptions, we prove the local limit of this graph is a m…

cs.DS2026

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs

Abhishek Dhawan, Nhi U. Dinh, Eren C. Kızıldağ +2

We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within e…