Percolation in dense storage arrays

DOI10.1016/S0378-4371(02)01153-6zbMath1001.68003MaRDI QIDQ1850367

Harald Huels, Robert B. Garner, Scott Kirkpatrick, Winfried W. Wilcke

Publication date: 3 December 2002

Published in: Physica A (Search for Journal in Brave)

zbMATH Keywords

data communication environmentredundancy strategiesshortest path lengths

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

Bootstrap percolation via automated conjecturing ⋮ Exact solution of a jamming transition: Closed equations for a bootstrap percolation problem ⋮ Sharp thresholds for contagious sets in random graphs ⋮ Bootstrap and diffusion percolation transitions in three-dimensional lattices ⋮ Finite-size effects for anisotropic bootstrap percolation: Logarithmic corrections

Cites Work

• A note on two problems in connexion with graphs
• Sudden emergence of a giant \(k\)-core in a random graph