2021/03/01 by Eray Can Elumar, Elumar, Eray Can, Mansi Sood +4 · 1 citation
Computer Science · Mathematics · #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Security in Wireless Sensor Networks #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.2103.01471
openalex publication_date 2021/03/01 · arxiv created 2021/03/02 · arxiv updated 2021/03/03 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
Random K-out graphs, denoted ℍ(n;K), are generated by each of the n nodes drawing K out-edges towards K distinct nodes selected uniformly at random, and then ignoring the orientation of the arcs. Recently, random K-out graphs have been used in applications as diverse as random (pairwise) key predistribution in ad-hoc networks, anonymous message routing in crypto-currency networks, and differentially-private federated averaging. In many applications, connectivity of the random K-out graph when some of its nodes are dishonest, have failed, or have been captured is of practical interest. We provide a comprehensive set of results on the connectivity and giant component size of ℍ(n;Kn,γn), i.e., random K-out graph when γn of its nodes, selected uniformly at random, are deleted. First, we derive conditions for Kn and n that ensure, with high probability (whp), the connectivity of the remaining graph when the number of deleted nodes is γn=Ω(n) and γn=o(n), respectively. Next, we derive conditions for ℍ(n;Kn,γn) to have a giant component, i.e., a connected subgraph with Ω(n) nodes, whp. This is also done for different scalings of γn and upper bounds are provided for the number of nodes outside the giant component. Simulation results are presented to validate the usefulness of the results in the finite node regime.