Emergent Spectral Properties Of River Network Topology: An Optimal Channel Network Approach

Abstract

Characterization of river drainage networks has been a subject of research for many years. However, most previous studies have been limited to quantities which are loosely connected to the topological properties of these networks. In this work, through a graph-theoretic formulation of drainage river networks, we investigate the eigenvalue spectra of their adjacency matrix. First, we introduce a graph theory model for river networks and explore the properties of the network through its adjacency matrix. Next, we show that the eigenvalue spectra of such complex networks follow distinct patterns and exhibit striking features including a spectral gap in which no eigenvalue exists as well as a finite number of zero eigenvalues. We show that such spectral features are closely related to the branching topology of the associated river networks. In this regard, we find an empirical relation for the spectral gap and nullity in terms of the energy dissipation exponent of the drainage networks. In addition, the eigenvalue distribution is found to follow a finite-width probability density function with certain skewness which is related to the drainage pattern. Our results are based on optimal channel network simulations and validated through examples obtained from physical experiments on landscape evolution. These results suggest the potential of the spectral graph techniques in characterizing and modeling river networks.

Publication Date

12-1-2017

Publication Title

Scientific Reports

Volume

7

Issue

1

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1038/s41598-017-11579-1

Socpus ID

85029317951 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85029317951

This document is currently not available here.

Share

COinS