On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes

Eray Can Elumar, Mansi Sood, Osman Yagan

Random K-out graphs, denoted $\mathbb{H}(n;K)$, are generated by each of the $n$ nodes drawing $K$ out-edges towards $K$ distinct nodes selected uniformly at random, and then ignor…