Combinatorial Analysis of Growth Models for Series-Parallel Networks
Keyword(s):
We give combinatorial descriptions of two stochastic growth models for series-parallel networks introduced by Hosam Mahmoud by encoding the growth process via recursive tree structures. Using decompositions of the tree structures and applying analytic combinatorics methods allows a study of quantities in the corresponding series-parallel networks. For both models we obtain limiting distribution results for the degree of the poles and the length of a random source-to-sink path, and furthermore we get asymptotic results for the expected number of source-to-sink paths. Moreover, we introduce generalizations of these stochastic models by encoding the growth process of the networks via further important increasing tree structures.
Keyword(s):
1998 ◽
Vol 212
(3)
◽
pp. 157-166
◽
2014 ◽
Vol 70
(a1)
◽
pp. C97-C97
Keyword(s):
1972 ◽
Vol 4
(02)
◽
pp. 193-232
◽
1995 ◽
Vol 35
(1)
◽
pp. 65-82
◽