42 citations · 47 across the 8 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2022
Rank-k random graphs and finite type branching processes
Suman Chakraborty, Kjell Raaijmakers, Remco van der Hofstad
In this note, we investigate fundamental relations between exploration processes in random graphs, and branching processes. We formulate a class of models that we call {\em rank-$k…
math.PR2016★ 5 cited
Large subgraphs in pseudo-random graphs
Anirban Basak, Shankar Bhamidi, Suman Chakraborty +1
We consider classes of pseudo-random graphs on vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^δ,n…