On Horton's Law for Random Channel Networks
From MaRDI portal
Cited in
(7)- Efficient computation of the iteration of functions
- The permuted analogues of three Catalan sets
- A note on the Horton-Strahler number for random trees
- Reductions of binary trees and lattice paths induced by the register function
- The Horton-Strahler number of conditioned Galton-Watson trees
- On the Horton-Strahler number for random tries
- Topological self-similarity on the random binary-tree model
This page was built for publication: On Horton's Law for Random Channel Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885781)