QUASI-RANDOM SPANNING TREE MODEL FOR THE EARLY RIVER NETWORK

We consider a model for the formation of a river network in which the erosion process plays a role only at the initial stage. Once a global connectivity is achieved, no further evolution takes place. In spite o f this, the network reproduces approximately most of the empirical sta tistical results of the 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 spannin g tree graphs in which different configurations occur quasirandomly. A new loopless percolation model is also defined at an intermediate sta ge of evolution of the river network.