6 citations · 8 across the 13 of their papers we have counts for
13 papers
Estimating Community Boundaries in Geometric Random Graphs
Taha Ameen, Neeladri Maitra
The unit square is divided into two rectangles by the vertical line , where . Consider independent uniformly distributed points on , which we int…
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…
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…
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…
On exponentially height-penalized random trees
Louigi Addario-Berry, Benoît Corsini, Neeladri Maitra +1
Given and , a $\textit{$μn$}$ is a random plane tree with vertices with law given by $…
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…
On random bipartite graphs evolving by degrees
Neeladri Maitra
In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices into two disjoint parts and…
Sharp Online Hardness for Large Balanced Independent Sets
Abhishek Dhawan, Eren C. Kızıldağ, Neeladri Maitra
We study the algorithmic problem of finding large -balanced independent sets in dense random bipartite graphs; an independent set is -balanced if a proportion of its vert…
Annealed Potts models on rank-1 inhomogeneous random graphs
Cristian Giardinà, Claudio Giberti, Remco van der Hofstad +2
In this paper, we study the annealed ferromagnetic -state Potts model on sparse rank-1 random graphs, where vertices are equipped with a vertex weight, and the probability of an…
Condensation in scale-free geometric graphs with excess edges
Remco van der Hofstad, Pim van der Hoorn, Céline Kerriou +2
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the mo…
Long-range competition on the torus
Bas Lodewijks, Neeladri Maitra
We study competition between two growth models with long-range correlations on the torus of size in dimension . We append the edge set of the torus $\mathbb…
Scaling of the clustering function in spatial inhomogeneous random graphs
Remco van der Hofstad, Pim van der Hoorn, Neeladri Maitra
We consider an infinite spatial inhomogeneous random graph model with an integrable connection kernel that interpolates nicely between existing spatial random graph models. Key exa…
Local limits of spatial inhomogeneous random graphs
Remco van der Hofstad, Pim van der Hoorn, Neeladri Maitra
Consider a set of vertices, where each vertex has a location in that is sampled uniformly from the unit cube in , and a weight associated to it. Co…