Expected Value Expansions in Random Subgraphs with Applications to Network Reliability

DOI10.1017/S0963548398003629MaRDI QIDQ4238175zbMATH OpenOpenAlexWikidataFDO

Authors Kyle T. Siegrist

Publication date 13 April 1999

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

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

zbMATH Keywords

connectednessnetwork reliabilitysubgraph expansions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of graph theory (05C90)

Recommendations

• scientific article; zbMATH DE number 4012499
• Expected value expansions in rooted graphs
• scientific article; zbMATH DE number 3880759
• Network reliability
• New expected value expansions of rooted graphs

Cited in

(6)

• Expected rank in antimatroids
• Expected value expansions in rooted graphs
• New expected value expansions of rooted graphs
• Distinguished vertices in probabilistic rooted graphs
• scientific article; zbMATH DE number 4012499 (Why is no real title available?)
• Asymptotics of subexponential max plus networks: the stochastic event graph case

This page was built for publication: Expected Value Expansions in Random Subgraphs with Applications to Network Reliability

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