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 cs.SIShow all

1 paper · 1 filter

cs.SI2025

On Balancing Sparsity with Reliable Connectivity in Distributed Network Design with Random K-out Graphs

Mansi Sood, Eray Can Elumar, Osman Yagan

In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliabl…