Tight Bounds on Vertex Connectivity Under Sampling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Algorithms Year : 2017

Tight Bounds on Vertex Connectivity Under Sampling


A fundamental result by Karger [10] states that for any $λ$-edge-connected graph with n nodes, independently sampling each edge with probability $p = Ω(log(n)/λ)$ results in a graph that has edge connectivity $Ω(λp)$, with high probability. This paper proves the analogous result for vertex connectivity, when either vertices or edges are sampled. We show that for any k-vertex-connected graph G with n nodes, if each node is independently sampled with probability $p = Ω(log(n)/k)$, then the subgraph induced by the sampled nodes has vertex connectivity $Ω(kp 2$), with high probability. If edges are sampled with probability $p = Ω(log(n)/k)$ then the sampled subgraph has vertex connectivity $Ω(kp$), with high probability. Both bounds are existentially optimal.
Fichier principal
Vignette du fichier
talg2017kvc.pdf (401.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01635743 , version 1 (15-11-2017)



Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn. Tight Bounds on Vertex Connectivity Under Sampling. ACM Transactions on Algorithms, 2017, 13 (2), pp.19:1 - 19:26. ⟨10.1145/3086465⟩. ⟨hal-01635743⟩
142 View
166 Download



Gmail Facebook Twitter LinkedIn More