1 citations · 1 across the 4 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2023★ 1 cited
On the Robustness, Connectivity and Giant Component Size of Random K-out Graphs
Eray Can Elumar, Mansi Sood, Osman Yağan
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentr…
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 , are generated by each of the nodes drawing out-edges towards distinct nodes selected uniformly at random, and then ignor…