Eray Can Elumar

activity

20212025

most citedOn the Robustness, Connectivity and Giant Component Size of Random K-out Graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing 2021 · cs.ITShow all

1 paper · 2 filters

cs.IT2021

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 $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…