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 2026 · math.PRShow all

2 papers · 2 filters

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 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…