2016/05/08 by Markus Kuba, Kuba, Markus, Alois Panholzer +1 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Data Management and Algorithms #FOS: Mathematics #Stochastic processes and statistical mechanics #math.CO
paper · pdf · doi:10.48550/arxiv.1605.02307
One of the proceedings-papers of the conference AofA 2016: 27th International conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Poland, July 4-8, 2016
arxiv created 2016/05/08 · openalex publication_date 2016/05/08 · arxiv updated 2018/04/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.