Related papers: Universal Exponent for Transport in Mixed Hamilton…
We study finite-time mixing in time-periodic open flow systems. We describe the transport of densities in terms of a transfer operator, which is represented by the transition matrix of a finite-state Markov chain. The transport processes in…
In this article we consider an aggregate loss model with dependent losses. The losses occurrence process is governed by a two-state Markovian arrival process (MAP2), a Markov renewal process process that allows for (1) correlated…
In this note we will adapt Topping's $\mathcal{L}$-optimal transportation theory for Ricci flow to a more general situation, i.e. to a closed manifold $(M,g_{ij}(t))$ evolving by $\partial_tg_{ij}=-2S_{ij}$, where $S_{ij}$ is a symmetric…
The optimal transport (OT) map is a geometry-driven transformation between high-dimensional probability distributions which underpins a wide range of tasks in statistics, applied probability, and machine learning. However, existing…
We investigate the survivor distributions of a spatially extended model of competitive dynamics in different geometries. The model consists of a deterministic dynamical system of individual agents at specified nodes, which might or might…
In this paper, we develop a general theory for the estimation of the transition probabilities of reversible Markov chains using the maximum entropy principle. A broad range of physical models can be studied within this approach. We use…
In low temperature limit, we study electron counting statistics of a disordered conductor. We derive an expression for the distribution of charge transmitted over a finite time interval by using a result from the random matrix theory of…
New results on conditional joint probability distributions of first exit times are presented for a continuous-time stochastic process defined as the mixture of Markov jump processes moving at different speeds on the same finite state space,…
We study a problem of data packet transport in scale-free networks whose degree distribution follows a power-law with the exponent $\gamma$. We define load at each vertex as the accumulated total number of data packets passing through that…
Let $(M,d,\mu)$ be a uniformly discrete metric measure space satisfying space homogeneous volume doubling condition. We consider discrete time Markov chains on $M$ symmetric with respect to $\mu$ and whose one-step transition density is…
Stochastic processes play a key role for modeling a huge variety of transport problems out of equilibrium, with manifold applications throughout the natural and social sciences. To formulate models of stochastic dynamics the conventional…
We investigate the three-dimensional compressible Euler-Maxwell system, a model for simulating the transport of electrons interacting with propagating electromagnetic waves in semiconductor devices. First, we show the global well-posedness…
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…
This work derives the Navier--Stokes hydrodynamic equations for a model of a confined, quasi-two-dimensional, $s$-component mixture of inelastic, smooth, hard spheres. Using the inelastic version of the revised Enskog theory, macroscopic…
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…
We consider the simple random walk on Galton-Watson trees with supercritical offspring distribution, conditioned on non-extinction. In case the offspring distribution has finite support, we prove an upper bound for the annealed return…
We consider the tail distribution of the edge cover time of a specific non-Markov process, $\delta$ once-reinforced random walk, on finite connected graphs, whose transition probability is proportional to weights of edges. Here the weights…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph 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…
We introduce new models of very weakly coupled logistic and tent maps for which orbits of very long period are found. The length of these periods is far greater than one billion. The property of these models relatively to the distribution…