No label defined (Q3813587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4083346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4083346 |
Statements
1988
0 references
network reliability
0 references
reliability assessment
0 references
computer networks
0 references
random spanning trees
0 references
Monte Carlo sampling technique
0 references
reliability polynomial
0 references
0.8470126390457153
0 references
0.8330212235450745
0 references
0.8282479047775269
0 references
0.8280148506164551
0 references
0.8181685209274292
0 references
[For the entire collection see Zbl 0656.00028.] Using an efficient algorithm for generating random spanning trees of a graph, we develop a Monte Carlo sampling technique for estimating the coefficients of the (all-terminal) reliability polynomial of the graph. The resulting method reduces the variance of naive Monte Carlo methods, and hence requires many fewer trials.
0 references