A quasi-random spanning tree model for the early river network

Abstract

We consider a model for the formation of a river network in which erosion process plays a role only at the initial stage. Once a global connectivity is achieved, no further evolution takes place. In spite of this, the network reproduces approximately most of the empirical statistical results of natural river network. It is observed that the resulting network is a spanning tree graph and therefore this process could be looked upon as a new algorithm for the generation of spanning tree graphs in which different configurations occur quasi-randomly. A new loop-less percolation model is also defined at an intermediate stage of evolution of the river network.

10 pages, RevTex, 4 postscript figures, accepted in PRL

Cited by in corpus (12)

• Geometry of River Networks I: Scaling, Fluctuations, and Deviations
• Scaling behavior of explosive percolation on the square lattice
• A new route to Explosive Percolation
• Fracturing ranked surfaces
• Local minimal energy landscapes in river networks
• Internal Avalanches in a Granular Medium
• Stacked triangular lattice: Percolation properties
• Fractal Dimension of Backbone of Eden Trees
• Phase Transition in a Self-repairing Random Network
• Evaporation-induced self-assembling of few-layer graphene into a fractal-like conductive macro-network with a reduction of percolation threshold
• Network-Growth Rule Dependence of Fractal Dimension of Percolation Cluster on Square Lattice
• Universality and non-universality in behavior of self-repairing random networks