DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS

DOI10.1017/S0269964816000310zbMath1370.90059MaRDI QIDQ5358105

Ludger Rüschendorf, Hosam M. Mahmoud, Yarong Feng

Publication date: 19 September 2017

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

zbMATH Keywords

graphsstochastic modellingapplied probabilityprobabilistic networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Combinatorial probability (60C05)

Related Items

A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION

Cites Work

• Unnamed Item
• Some asymptotic theory for the bootstrap
• Parallel recognition of series-parallel graphs
• A general limit theorem for recursive algorithms and combinatorial structures
• The contraction method for recursive algorithms
• Convergence of a branching type recursion
• On a multivariate contraction method for random recursive structures with applications to Quicksort
• Fixed Point Theorems and Their Applications
• SOME NODE DEGREE PROPERTIES OF SERIES–PARALLEL GRAPHS EVOLVING UNDER A STOCHASTIC GROWTH MODEL
• Vertices of given degree in series-parallel graphs
• On a stochastic difference equation and a representation of non–negative infinitely divisible random variables
• On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
• A random hierarchical lattice: the series-parallel graph and its properties
• Probability metrics and recursive algorithms
• SOME PROPERTIES OF BINARY SERIES-PARALLEL GRAPHS
• A limit theorem for “quicksort”