Related papers: Open-flow mixing and transfer operators

We address the evaluation of mixing efficiency in experiments of chaotic mixing inside an open-flow channel. Since the open flow continuously brings new fluid into the limited mixing region, it is difficult to define relevant mixing…

We introduce a numerical framework for integrating Markovian dynamics on tree tensor operator (TTO) ansatz states. This framework enables the simulation of both transient and steady-state regimes of systems governed by the Lindblad master…

In this paper we analyze the distributional properties of a busy period in an on-off fluid queue and the a first passage time in a fluid queue driven by a finite state Markov process. In particular, we show that in Anick-Mitra-Sondhi model…

In this paper, we introduce a nonlinear stochastic model to describe the propagation of information inside a computer processor. In this model, a computational task is divided into stages, and information can flow from one stage to another.…

A network of signalized intersections is modeled as a queuing network. The intersections are regulated by fixed-time (FT) controls, all with the same cycle length or period, $T$. Vehicles arrive from outside the network at entry links in a…

In this paper, we analyze the number of departures from an initially empty $M/M/\infty$ system in a finite time interval. We observe the system during an exponentially distributed period of time starting from the time origin. We then…

Finite order Markov models are theoretically well-studied models for dependent discrete data. Despite their generality, application in empirical work when the order is large is rare. Practitioners avoid using higher order Markov models…

Markov switching models are a popular family of models that introduces time-variation in the parameters in the form of their state- or regime-specific values. Importantly, this time-variation is governed by a discrete-valued latent…

We analyse diffusion dynamics on weakly-coupled networks (interconnected networks) by means of separation of time scales. Using an adiabatic approximation we reduced the system dynamics to a Markov chain with aggregated variables and…

We introduce the concept of a Markov influence system (MIS) and analyze its dynamics. An MIS models a random walk in a graph whose edges and transition probabilities change endogenously as a function of the current distribution. This…

In this work, we consider the case where a source with bursty traffic can adjust the transmission duration in order to increase the reliability. The source is equipped with a queue in order to store the arriving packets. We model the system…

We describe a systematic approach to construct coarse-grained Markov state models from molecular dynamics data of systems driven into a non-equilibrium steady state. We apply this method to study the globule-stretch transition of a single…

The bike sharing systems are fast increasing as a public transport mode in urban short trips, and have been developed in many major cities around the world. A major challenge in the study of bike sharing systems is that large-scale and…

The Lindblad master equation is one of the main approaches to open quantum systems. While it has been widely applied in the context of condensed matter systems to study properties of steady states in the limit of long times, the actual…

The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…

In order to develop a toy model for car's traffic in cities, in this paper we analyze, by means of numerical simulations, the transition among fluid regimes and a congested jammed phase of the flow of "kinetically constrained" hard spheres…

We study the well-posedness of a class of dynamical flow network systems describing the dynamical mass balance among a finite number of cells exchanging flow of a commodity between themselves and with the external environment. Systems in…

The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…

We consider an additive functional driven by a time-inhomogeneous Markov chain with a finite state space. Our study focuses on the joint distribution of the two-sided exit time and the state of the driving Markov chain at the time of exit,…

We have studied a chaotic transport in a two-dimensional periodic vortical flow under a time-dependent perturbation with period T where the global diffusion occurs along the stochastic web. By using the Melnikov method we construct the…