6 citations · 8 across the 13 of their papers we have counts for
5 papers · 1 filter
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…