1 citations · 1 across the 7 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.IT2019
On the Strength of Connectivity of Inhomogeneous Random K-out Graphs
Mansi Sood, Osman Yağan
Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as…