Given an input graph Gin =(V,E_in), we consider the problem of designing a sparse subgraph G = (V, E) with E ⊆ E_in that supports a large matching after some nodes in V are randomly deleted. We study three families of sparse graph designs (namely, Clusters, Rings, and Erdős-Rényi graphs) and...