Tracer dynamics in polymer networks: Generalized Langevin description.

Tracer diffusion in polymer networks and hydrogels is relevant in biology and technology, while it also constitutes an interesting model process for the dynamics of molecules in fluctuating, heterogeneous soft matter. Here, we systematically study the time-dependent dynamics and (non-Markovian) memory effects of tracers in polymer networks based on (Markovian) implicit-solvent Langevin simulations. In particular, we consider spherical tracer solutes at high dilution in regular, tetrafunctional bead-spring polymer networks and control the tracer-network Lennard-Jones (LJ) interactions and the polymer density. Based on the analysis of the memory (friction) kernels, we recover the expected long-time transport coefficients and demonstrate how the short-time tracer dynamics, polymer fluctuations, and the viscoelastic response are interlinked. Furthermore, we fit the characteristic memory modes of the tracers with damped harmonic oscillations and identify LJ contributions, bond vibrations, and slow network relaxations. Tuned by the LJ interaction parameter, these modes enter the kernel with an approximately linear to quadratic scaling, which we incorporate into a reduced functional form for convenient tracer memory interpolation and extrapolation. This eventually leads to highly efficient simulations utilizing the generalized Langevin equation, in which the polymer network acts as an additional thermal bath with a tunable intensity.

Generalized Langevin dynamics simulation with non-stationary memory kernels: How to make noise.

We present a numerical method to produce stochastic dynamics according to the generalized Langevin equation with a non-stationary memory kernel. This type of dynamics occurs when a microscopic system with an explicitly time-dependent Liouvillian is coarse-grained by means of a projection operator formalism. We show how to replace the deterministic fluctuating force in the generalized Langevin equation by a stochastic process, such that the distributions of the observables are reproduced up to moments of a given order. Thus, in combination with a method to extract the memory kernel from simulation data of the underlying microscopic model, the method introduced here allows us to construct and simulate a coarse-grained model for a driven process.

Generating functions for message passing on weighted networks: Directed bond percolation and susceptible, infected, recovered epidemics.

We study the SIR (susceptible, infected, removed/recovered) model on directed graphs with heterogeneous transmission probabilities within the message-passing approximation. We characterize the percolation transition, predict cluster size distributions, and suggest vaccination strategies. All predictions are compared to numerical simulations on real networks. The percolation threshold that we predict is a rigorous lower bound to the threshold on real networks. For large, locally treelike networks, our predictions agree very well with the numerical data.