Combinatorial analysis of growth models for series-parallel networks

zbMATH Open1409.05183arXiv1605.02307MaRDI QIDQ4632491FDOQ4632491

Authors: Markus Kuba, Alois Panholzer 

Publication date: 29 April 2019

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1605.02307

Recommendations

• Combinatorial analysis of growth models for series-parallel networks
• Some node degree properties of series-parallel graphs evolving under a stochastic growth model
• SOME PROPERTIES OF BINARY SERIES-PARALLEL GRAPHS
• On the combinatorics of binary series-parallel graphs
• scientific article; zbMATH DE number 4039939

zbMATH Keywords

growth modelsseries-parallel networksdistributional analysisnode degreessource-to-sink paths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80)

Cited In (3)

• Combinatorial analysis of growth models for series-parallel networks
• Title not available (Why is that?)
• Some node degree properties of series-parallel graphs evolving under a stochastic growth model

This page was built for publication: Combinatorial analysis of growth models for series-parallel networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632491)