Reducibility of stochastic networks

Bajis Dodin

Omega, 1985, vol. 13, issue 3, 223-232

Abstract: This paper deals with the problem of reducing a stochastic network to one equivalent activity. The problem was motivated by the question of determining or approximating the probability distribution function of the duration of the longest or shortest path in a stochastic network. We define a particular reduction and use it to characterize the reducibility of such a network. The network can be reduced to one equivalent activity if the network does not have a special graph which we call the 'interdictive graph', or IG for short. If an IG is embedded in the network, the network is irreducible. In this case, its reduction becomes possible by duplicating some of the arcs in the irreducible network. The concept of duplicating an arc is introduced, then it is used to identify the arcs which can be duplicated. The reduction procedure is stated and illustrative examples are provided. An upper bound on the number of duplications is established.

Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(85)90060-X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:13:y:1985:i:3:p:223-232

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().