SearcharxivSearch

arXiv · 1811.00593

Dynamics of drainage under stochastic rainfall in river networks

Abstract

We consider a linearized dynamical system modelling the flow rate of water along the rivers and hillslopes of an arbitrary watershed. The system is perturbed by a random rainfall in the form of a compound Poisson process. The model describes the evolution, at daily time scales, of an interconnected network of linear reservoirs and takes into account the differences in flow celerity between hillslopes and streams as well as their spatial variation. The resulting stochastic process is a piece-wise deterministic Markov process of the Orstein-Uhlembeck type. We provide an explicit formula for the Laplace transform of the invariant density of streamflow in terms of the geophysical parameters of the river network and the statistical properties of the precipitation field. As an application, we include novel formulas for the invariant moments of the streamflow at the watershed's outlet, as well as the asymptotic behavior of extreme discharge events.

Explore related subjects

Keep this discovery

BibTeXRIS

Jorge M Ramirez, Corina Constantinescu. 2018-11-01. Dynamics of drainage under stochastic rainfall in river networks. https://arxiv.org/abs/1811.00593

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR