Neeladri Maitra

collaborators

10 papers

math.RT2026

On $2$ -blocks with quaternion defect groups

Charles Eaton, Florian Eisele, Radha Kessar +2

We determine the Morita equivalence classes of $2$ -blocks with quaternion defect groups of arbitrary $2$ -power order, thereby completing the proof of Donovan's conjecture for block…

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…

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…

math.PR2025

On exponentially height-penalized random trees

Louigi Addario-Berry, BenoÃ®t Corsini, Neeladri Maitra +1

Given $n \in N$ and $I^¼ \in R$ , a $\textit{$Î¼ $- h e i g h t - bia se d t r eeo f s i z e$ n$}$ is a random plane tree $T_{n}$ with $n$ vertices with law given by…

math.PR2025

Evolution of recursive trees with limited memory

Omer Angel, Shankar Bhamidi, Serte Donderwinkel +2

Motivated by questions in social networks, distributed computing and probabilistic combinatorics, the last few years have seen increasing interest in network evolution models where…