Networks have entered the mainstream lexicon over the last ten years. This coincides with
the pervasive use of networks in a host of disciplines of interest to industry and academia …

The goal of this paper is to derive a small perturbation analysis for networks subject to
random changes of a small number of edges. Small perturbation theory allows us to derive …

This paper discusses the reliability of a graph in which the links are perfectly reliable but the
nodes may fail with certain probability p. Calculating graph node reliability is an NP-Hard …

Various methods have been proposed to evaluate the reliability of a graph, one of the most
well known of which is the reliability polynomial, R (G, p). It is assumed that G (V, E) is a …

In this paper some new ideas are presented concerning speeding up calculation of
coefficients of all-terminal reliability polynomial (CRPs) of an undirected random graph with …

Moore and Shannon introduced a probabilistic model in which network nodes are assumed
to be completely reliable, and communication links or edges can fail with a given probability …

The problem of fast estimating of reliability polynomial'coefficients is considered in the paper
in the case of all-terminal reliability (probability of a graph being connected). Obtaining lower …

Abstract Systems engineers, strategists and technical leaders of all stripes are tasked with
the challenge of managing stakeholders in a complex environment. In the complex domain …

This paper discusses the modeling of terminal network reliability using reliability
polynomials. A simulator was developed and its results compared with the values of the …

This paper presents through experimental studies the distribution of roots of graph
polynomials associated with b-matchings of regular graphs. It aims to acknowledge the …