On connectivity and robustness of random graphs with inhomogeneity

Shang, Yilun (2023) On connectivity and robustness of random graphs with inhomogeneity. Journal of Applied Probability, 60 (1). pp. 284-294. ISSN 0021-9002

Preview

Text connectivityrobustness.pdf - Accepted Version Download (149kB) | Preview

Abstract

The study of threshold functions has a long history in random graph theory. It is known that the thresholds for minimum degree k, k-connectivity, as well as k-robustness coincide for a binomial random graph. In this paper we consider an inhomogeneous random graph model, which is obtained by including each possible edge independently with an individual probability. Based on an intuitive concept of neighborhood density, we show two sufficient conditions guaranteeing k-connectivity and k-robustness, respectively, which are asymptotically equivalent. Our framework sheds some light on extending uniform threshold values in homogeneous random graphs to threshold landscapes in inhomogeneous random graphs.

Actions (login required)

View Item

Downloads