3 citations · 4 across the 11 of their papers we have counts for
6 papers · 1 filter
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…
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…
Existence and Size of the Giant Component in Inhomogeneous Random K-out Graphs
Mansi Sood, Osman Yagan
Random K-out graphs are receiving attention as a model to construct sparse yet well-connected topologies in distributed systems including sensor networks, federated learning, and c…
Tight Bounds for Connectivity of Random K-out Graphs
Mansi Sood, Osman Yagan
Random K-out graphs are used in several applications including modeling by sensor networks secured by the random pairwise key predistribution scheme, and payment channel networks.…
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…
Towards -connectivity in Heterogeneous Sensor Networks under Pairwise Key Predistribution
Mansi Sood, Osman Yağan
We study the secure and reliable connectivity of wireless sensor networks under the heterogeneous pairwise key predistribution scheme. This scheme was recently introduced as an ext…