On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes
Pages 2572 - 2577
Abstract
Random K-out graphs, denoted <tex>$\mathbb{H}(n;K)$</tex>, are generated by each of the <tex>$n$</tex> nodes drawing <tex>$K$</tex> out-edges towards <tex>$K$</tex> 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 <tex>$\mathbb{H}(n;K_{n},\gamma_{n})$</tex>, i.e., random K-out graph when <tex>$\gamma_{n}$</tex> of its nodes, selected uniformly at random, are deleted. First, we derive conditions for <tex>$K_{n}$</tex> and <tex>$n$</tex> that ensure, with high probability (whp), the connectivity of the remaining graph when the number of deleted nodes is <tex>$\gamma_{n}=\Omega(n)$</tex> and <tex>$\gamma_{n}=o(n)$</tex>, respectively. Next, we derive conditions for <tex>$\mathbb{H}(n;K_{n}, \gamma_{n})$</tex> to have a giant component, i.e., a connected subgraph with <tex>$\Omega(n)$</tex> nodes, whp. This is also done for different scalings of <tex>$\gamma_{n}$</tex> 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.
References
[1]
M. E. Newman, D. J. Watts, and S. H. Strogatz, “Random graph models of social networks,” Proceedings of the National Academy of Sciences, vol. 99, no. suppl 1, pp. 2566–2572, 2002.
[2]
S. M. Kakade, M. Kearns, L. E. Ortiz, R. Pemantle, and S. Suri, “Economic properties of social networks,” in Advances in Neural Information Processing Systems, 2005, pp. 633–640.
[3]
A. Goldenberg, A. X. Zheng, S. E. Fienberg, E. M. Airoldiet al., “A survey of statistical network models,” Foundations and Trends in Machine Learning, vol. 2, no. 2, pp. 129–233, 2010.
[4]
O. Yagan and A. M. Makowski, “On the connectivity of sensor networks under random pairwise key predistribution,” IEEE Transactions on Information Theory, vol. 59, no. 9, pp. 5754–5762, Sept 2013.
[5]
C. Sabater, A. Bellet, and J. Ramon, “Distributed differentially private averaging with improved utility and robustness to malicious parties,” 2020.
[6]
G. Fanti, S. B. Venkatakrishnan, S. Bakshi, B. Denby, S. Bhargava, A. Miller, and P. Viswanath, “Dandelion++: Lightweight cryptocurrency networking with formal anonymity guarantees,” Proc. ACM Meas. Anal. Comput. Syst., vol. 2, no. 2, pp. 29:1–29:35, Jun. 2018.
[7]
O. Yagan and A. M. Makowski, “Modeling the pairwise key predistribution scheme in the presence of unreliable links,” IEEE Transactions on Information Theory, vol. 59, no. 3, pp. 1740–1760, March 2013.
[8]
F. Yavuz, J. Zhao, O. Yagan, and V. Gligor, “Designing secure and reliable wireless sensor networks under a pairwise key predistribution scheme,” in 2015 IEEE International Conference on Communications (ICC). IEEE, 2015, pp. 6277–6283.
[9]
H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks,” in Proc. of IEEE S&P 2003, 2003.
[10]
R. Eletreby and O. Yağan, “Connectivity of inhomogeneous random K-out graphs,” IEEE Transactions on Information Theory, vol. 66, no. 11, pp. 7067–7080, 2020.
[11]
M. Sood and O. Yağan, “On the size of the giant component in inhomogeneous random k-out graphs,” arXiv preprint arXiv:, 2020, to appear in 59th IEEE Conference on Decision and Control (CDC 2020), December 2020.
[12]
T. I. Fenner and A. M. Frieze, “On the connectivity of random m-orientable graphs and digraphs,” Combinatorica, vol. 2, no. 4, pp. 347–359, Dec 1982.
[13]
O. Yağan and A. M. Makowski, “Wireless sensor networks under the random pairwise key predistribution scheme: Can resiliency be achieved with small key rings?” IEEE/ACM Transactions on Networking, vol. 24, no. 6, pp. 3383–3396, 2016.
[14]
O. Yağan and A. M. Makowski, “On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes,” Performance Evaluation, vol. 70, no. 7, pp. 493–512, 2013.
[15]
A. Frieze and M. Karoński, Introduction to random graphs. Cambridge University Press, 2016.
[16]
B. Bollobás, Random graphs. Cambridge university press, 2001.
[17]
F. Yavuz, J. Zhao, O. Yağan, and V. Gligor, “Toward k-connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links,” IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 6251–6271, 2015.
[18]
F. Yavuz, “$k$-connectivity in random K-out graphs intersecting Erdős-Rényi graphs,” IEEE Transactions on Information Theory, vol. 63, no. 3, pp. 1677–1692, 2017.
[19]
E. C. Elumar, M. Sood, and O. Yağan, “On the connectivity and giant component size of random k-out graphs under randomly deleted nodes,” 2020. [Online]. Available: http://www.andrew.cmu.edu/user/oyagan/Conferences/ISIT2021b.pdf.
[20]
P. Erdős and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci, vol. 5, no. 1, pp. 17–60, 1960.
[21]
P. Dellenbach, A. Bellet, and J. Ramon, “Hiding in the crowd: A massively distributed algorithm for private averaging with malicious adversaries,” 2018.
[22]
A. Mei, A. Panconesi, and J. Radhakrishnan, “Unassailable sensor networks,” in Proc. of the 4th International Conference on Security and Privacy in Communication Netowrks, ser. SecureComm'08. New York, NY, USA: ACM, 2008.
Index Terms
- On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes
Index terms have been assigned to the content through auto-classification.
Recommendations
Existence and Size of the Giant Component in Inhomogeneous Random K-Out Graphs
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 cryptocurrency networks. In response to the growing heterogeneity in ...
On the Size of the Giant Component in Inhomogeneous Random K-out Graphs
2020 59th IEEE Conference on Decision and Control (CDC)Inhomogeneous random K-out graphs were recently introduced to model heterogeneous sensor networks secured by random pairwise key predistribution schemes. First, each of the n nodes is classified as type-1 (respectively, type-2) with probability 0 < ...
The Volume of the Giant Component of a Random Graph with Given Expected Degrees
We consider the random graph model $G(\mathbf{w})$ for a given expected degree sequence ${\mathbf w} =(w_1, w_2, \ldots, w_n)$. If the expected average degree is strictly greater than $1$, then almost surely the giant component in $G$ of $G({\mathbf w})$...
Comments
Information & Contributors
Information
Published In
Jul 2021
3384 pages
Copyright © 2021.
Publisher
IEEE Press
Publication History
Published: 12 July 2021
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in