Related papers: Dynamical Phase Transitions for Flows on Finite Gr…
We continue our study of chaotic mixing and transport of passive particles in a simple model of a meandering jet flow [Prants, et al, Chaos {\bf 16}, 033117 (2006)]. In the present paper we study and explain phenomenologically a connection…
In porous media, there are three known regimes of fluid flows, namely, pre-Darcy, Darcy and post-Darcy. Because of their different natures, these are usually treated separately in literature. To study complex flows when all three regimes…
Wasserstein gradient flows on probability measures have found a host of applications in various optimization problems. They typically arise as the continuum limit of exchangeable particle systems evolving by some mean-field interaction…
Graph representations offer powerful and intuitive ways to describe data in a multitude of application domains. Here, we consider stochastic processes generating graphs and propose a methodology for detecting changes in stationarity of such…
In this paper, we study run-and-tumble particles moving on two copies of the discrete torus (referred to as layers), where the switching rate between layers depends on a mean-field interaction among the particles. We derive the hydrodynamic…
Directed percolation (DP), a universality class of continuous phase transitions, has recently been established as a possible route to turbulence in subcritical wall-bounded flows. In canonical straight pipe or planar flows, the transition…
We show that the clogging susceptibility and flow of particles moving through a random obstacle array can be controlled with a transverse or longitudinal ac drive. The flow rate can vary over several orders of magnitude, and we find both an…
We introduce and investigate a new model of a finite number of particles jumping forward on the real line. The jump lengths are independent of everything, but the jump rate of each particle depends on the relative position of the particle…
The flow of viscous fluids is considered as the aggregation of the motion of fluid particles when the fluid is conceived to be made up by an infinite number of particles. As an alternative of this conventional model, fluid motion could be…
The transition between low and high density phases is a typical feature of systems with social interactions. This contribution focuses on simple evacuation design of one room with one entrance and one exit; four passing-through experiments…
The transitional regime of plane channel flow is investigated {above} the transitional point below which turbulence is not sustained, using direct numerical simulation in large domains. Statistics of laminar-turbulent spatio-temporal…
We study evolution equations on metric graphs with reservoirs, that is graphs where a one-dimensional interval is associated to each edge and, in addition, the vertices are able to store and exchange mass with these intervals. Focusing on…
Traffic on a circular road is described by dynamic programming equations associated to optimal control problems. By solving the equations analytically, we derive the relation between the average car density and the average car flow, known…
Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state,…
The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…
Energy distributions of high frequency linear wave fields are often modelled in terms of flow or transport equations with ray dynamics given by a Hamiltonian vector field in phase space. Applications arise in underwater and room acoustics,…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…
Graphical flows add further structure to normalizing flows by encoding non-trivial variable dependencies. Previous graphical flow models have focused primarily on a single flow direction: the normalizing direction for density estimation, or…
We show that the generalized diffusion coefficient of a subdiffusive intermittent map is a fractal function of control parameters. A modified continuous time random walk theory yields its coarse functional form and correctly describes a…