We derive an Itô stochastic differential equation for entropy production in nonequilibrium Langevin processes. Introducing a random-time transformation, entropy production obeys a one-dimensional drift-diffusion equation, independent of the underlying physical model. This transformation allows us to identify generic properties of entropy production. It also leads to an exact uncertainty equality relating the Fano factor of entropy production and the Fano factor of the random time, which we also generalize to non-steady-state conditions.

We study the statistics of infima, stopping times, and passage probabilities of entropy production in nonequilibrium steady states, and we show that they are universal. We consider two examples of stopping times: first-passage times of entropy production and waiting times of stochastic processes, which are the times when a system reaches a given state for the first time. Our main results are as follows: (i) The distribution of the global infimum of entropy production is exponential with mean equal to minus Boltzmann’s constant; (ii) we find exact expressions for the passage probabilities of entropy production; (iii) we derive a fluctuation theorem for stopping-time distributions of entropy production. These results have interesting implications for stochastic processes that can be discussed in simple colloidal systems and in active molecular processes. In particular, we show that the timing and statistics of discrete chemical transitions of molecular processes, such as the steps of molecular motors, are governed by the statistics of entropy production. We also show that the extreme-value statistics of active molecular processes are governed by entropy production; for example, we derive a relation between the maximal excursion of a molecular motor against the direction of an external force and the infimum of the corresponding entropy-production fluctuations. Using this relation, we make predictions for the distribution of the maximum backtrack depth of RNA polymerases, which follow from our universal results for entropy-production infima.

We show that the steady-state entropy production rate of a stochastic process is inversely proportional to the minimal time needed to decide on the direction of the arrow of time. Here we apply Wald’s sequential probability ratio test to optimally decide on the direction of time’s arrow in stationary Markov processes. Furthermore, the steady-state entropy production rate can be estimated using mean first-passage times of suitable physical variables. We derive a first-passage time fluctuation theorem which implies that the decision time distributions for correct and wrong decisions are equal. Our results are illustrated by numerical simulations of two simple examples of nonequilibrium processes.

Sparse non-Hermitian random matrices arise in the study of disordered physical systems with asymmetric local interactions, and have applications ranging from neural networks to ecosystem dynamics. The spectral characteristics of these matrices provide crucial information on system stability and susceptibility, however, their study is greatly complicated by the twin challenges of a lack of symmetry and a sparse interaction structure. In this review we provide a concise and systematic introduction to the main tools and results in this field. We show how the spectra of sparse non-Hermitian matrices can be computed via an analogy with infinite dimensional operators obeying certain recursion relations. With reference to three illustrative examples—adjacency matrices of regular oriented graphs, adjacency matrices of oriented Erdős–Rényi graphs, and adjacency matrices of weighted oriented Erdős–Rényi graphs—we demonstrate the use of these methods to obtain both analytic and numerical results for the spectrum, the spectral distribution, the location of outlier eigenvalues, and the statistical properties of eigenvectors.

We study the totally asymmetric simple exclusion process (TASEP) on complex networks, as a paradigmatic model for transport subject to excluded volume interactions. Building on TASEP phenomenology on a single segment and borrowing ideas from random networks we investigate the effect of connectivity on transport. In particular, we argue that the presence of disorder in the topology of vertices crucially modifies the transport features of a network: irregular networks involve homogeneous segments and have a bimodal distribution of edge densities, whereas regular networks are dominated by shocks leading to a unimodal density distribution. The proposed numerical approach of solving for mean-field transport on networks provides a general framework for studying TASEP on large networks, and is expected to generalize to other transport processes.

We study the behavior of the inverse participation ratio and the localization transition in infinitely large random matrices through the cavity method. Results are shown for two ensembles of random matrices: Laplacian matrices on sparse random graphs and fully connected L\'evy matrices. We derive a critical line separating localized from extended states in the case of L\'evy matrices. Comparison between theoretical results and diagonalization of finite random matrices is shown.