SearcharxivSearch

arXiv · 1802.04355

Analysis of fluid flow models

Abstract

Markov-modulated fluids have a long history. They form a simple class of Markov additive processes, and were initially developed in the 1950s as models for dams and reservoirs, before gaining much popularity in the 1980s as models for buffers in telecommunication systems, when they became known as fluid queues. More recent applications are in risk theory and in environmental studies. In telecommunication systems modelling, the attention focuses on determining the stationary distribution of the buffer content. Early ODE resolution techniques have progressively given way to approaches grounded in the analysis of the physical evolution of the system, and one only needs now to solve a Riccati equation in order to obtain several quantities of interest. To the early algorithms proposed in the Applied Probability literature, numerical analysts have added new algorithms, improved in terms of convergence speed, numerical accuracy, and domain of applicability. We give here a high-level presentation of the matrix-analytic approach to the analysis of fluid queues, briefly address computational issues, and conclude by indicating how this has been extended to more general processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Guy Latouche, Giang Nguyen. 2018-02-12. Analysis of fluid flow models. https://arxiv.org/abs/1802.04355

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