Random Accessibility as a Parallelism to Reliability Studies on Simple Graphs

DOI10.1081/STA-200060736zbMath1078.90022MaRDI QIDQ5460672

Milton Sobel, M. Ebneshahrashoob, Tang'an Gao

Publication date: 18 July 2005

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

zbMATH Keywords

accessibility; reliability; network analysis

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

90B25: Reliability, availability, maintenance, inspection in operations research

Cites Work

• Bounds on the cover time
• On the existence of uniformly optimally reliable networks