A Sharp Threshold for Network Reliability

DOI10.1017/S0963548302005199MaRDI QIDQ4796015zbMATH OpenOpenAlexFDO

Authors Michael Krivelevich, Van Vu, Benny Sudakov

Publication date 11 April 2003

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548302005199

zbMATH Keywords

connectivityrandom graphrandom matroidreliability functionsharp threshold

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15)

Recommendations

• Sharp thresholds of graph properties, and the k-sat problem
• Bounds on probability of connectedness of a random graph
• The sharp threshold for percolation on expander graphs
• scientific article; zbMATH DE number 3168330
• Every monotone graph property has a sharp threshold

Cited in

(4)

• Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
• scientific article; zbMATH DE number 4070918 (Why is no real title available?)
• scientific article; zbMATH DE number 795107 (Why is no real title available?)
• Bounds on probability of connectedness of a random graph

This page was built for publication: A Sharp Threshold for Network Reliability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796015)