Title
Inflection points for network reliability
Author
Brown, J.I.
Koç, Y.
Kooij, R.E.
Publication year
2014
Abstract
Given a finite, undirected graph G (possibly with multiple edges), we assume that the vertices are operational, but the edges are each independently operational with probability p. The (all-terminal) reliability, Rel(G,p), of G is the probability that the spanning subgraph of operational edges is connected. It has been conjectured that reliability functions have at most one point of inflection in (0,1). We show that the all-terminal reliability of almost every simple graph of order n has a point of inflection, and there are indeed infinite families of graphs (both simple and otherwise) with more than one point of inflection. © 2013 Springer Science+Business Media New York.
Subject
Communication & Information
PNS - Performance of Networks & Services
TS - Technical Sciences
Infrastructures
Telecommunication
Information Society
All-terminal reliability
Connected
Graph
Inflection points
Network reliability
Graph theory
To reference this document use:
http://resolver.tudelft.nl/uuid:5abaf6ec-5171-4e81-9b1b-54ebc4999dd4
DOI
https://doi.org/10.1007/s11235-013-9820-0
TNO identifier
507120
Source
Telecommunication Systems, 56 (1), 79-84
Document type
article