Bounds in Total Variation Distance for Discrete-time Processes on the Sequence Space

Let P and (P) over tilde be the laws of two discrete-time stochastic processes defined on the sequence space S-N,where S is a finite set of points. In this paper we derive a bound on the total variation distance d(TV)(P, (P) over tilde) in terms of the cylindrical projections of P and (P) over tilde. We apply the result to Markov chains with finite state space and random walks on Z with not necessarily independent increments, and we consider several examples.

A Langevin dynamics approach for multi-layer mass transfer problems

We use Langevin dynamics simulations to study the mass diffusion problem across two adjacent porous layers of different transport properties. At the interface between the layers, we impose the Kedem-Katchalsky (KK) interfacial boundary condition that is well suited in a general situation. A detailed algorithm for the implementation of the KK interfacial condition in the Langevin dynamics framework is presented. As a case study, we consider a two-layer diffusion model of a drug-eluting stent.

Towards a comprehensive model for the impact of traffic patterns on air pollution

The impact of vehicular traffic on society is huge and multifaceted, including economic, social, health and environmental aspects. The problems is complex and hard to model since it requires to consider traffic patterns, air pollutant emissions, and the chemical reactions and dynamics of pollutants in the low atmosphere. This paper aims at exploring a comprehensive simulation tool ranging from vehicular traffic all the way to environmental impact.

Deep learning in systems medicine

Systems medicine (SM) has emerged as a powerful tool for studying the human body at the systems level with the aim of improving our understanding, prevention and treatment of complex diseases. Being able to automatically extract relevant features needed for a given task from high-dimensional, heterogeneous data, deep learning (DL) holds great promise in this endeavour. This review paper addresses the main developments of DL algorithms and a set of general topics where DL is decisive, namely, within the SM landscape.