8 papers · 1 filter
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…
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…
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…
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…
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…