On the Order of Random Channel Networks

DOI10.1137/0601005MaRDI QIDQ3960606zbMATH OpenOpenAlexFDO

Authors A. Meir, J. R. Pounder, J. W. Moon

Publication date 1980

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0601005

zbMATH Keywords

river network

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cited in

(10)

• Efficient computation of the iteration of functions
• The average height of binary trees and other simple trees
• A note on the Horton-Strahler number for random trees
• On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
• On the average number of nodes in a subtree of a tree
• The Horton-Strahler number of conditioned Galton-Watson trees
• On the Horton-Strahler number for random tries
• Solution of a problem of Yekutieli and Mandelbrot
• Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
• Topological self-similarity on the random binary-tree model

This page was built for publication: On the Order of Random Channel Networks

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