Refine
Year of publication
Document Type
- Article (18)
- ZIB-Report (4)
Language
- English (22)
Is part of the Bibliography
- no (22)
Keywords
- metastability (3)
- Markov state model (2)
- non-equilibrium molecular dynamics (2)
- coherent set, (1)
- effective dynamics (1)
- embedding (1)
- non-stationary forcing (1)
- reaction coordinate (1)
- slow dynamics (1)
- transfer operator (1)
Collective variables (CVs) are low-dimensional projections of high-dimensional system states. They are used to gain insights into complex emergent dynamical behaviors of processes on networks. The relation between CVs and network measures is not well understood and its derivation typically requires detailed knowledge of both the dynamical system and the network topology. In this Letter, we present a data-driven method for algorithmically learning and understanding CVs for binary-state spreading processes on networks of arbitrary topology. We demonstrate our method using four example networks: the stochastic block model, a ring-shaped graph, a random regular graph, and a scale-free network generated by the Albert-Barabási model. Our results deliver evidence for the existence of low-dimensional CVs even in cases that are not yet understood theoretically.
Reaction coordinates (RCs) are indicators of hidden, low-dimensional mechanisms that govern the long-term behavior of high-dimensional stochastic processes. We present a novel and general variational characterization of optimal RCs and provide conditions for their existence. Optimal RCs are minimizers of a certain loss function, and reduced models based on them guarantee a good approximation of the statistical long-term properties of the original high-dimensional process. We show that for slow-fast systems, metastable systems, and other systems with known good RCs, the novel theory reproduces previous insight. Remarkably, for reversible systems, the numerical effort required to evaluate the loss function scales only with the variability of the underlying, low-dimensional mechanism, and not with that of the full system. The theory provided lays the foundation for an efficient and data-sparse computation of RCs via modern machine learning techniques.
We consider time-continuous Markovian discrete-state dynamics on random networks of interacting agents and study the large population limit. The dynamics are projected onto low-dimensional collective variables given by the shares of each discrete state in the system, or in certain subsystems, and general conditions for the convergence of the collective variable dynamics to a mean-field ordinary differential equation are proved. We discuss the convergence to this mean-field limit for a continuous-time noisy version of the so-called "voter model" on Erdős-Rényi random graphs, on the stochastic block model, as well as on random regular graphs. Moreover, a heterogeneous population of agents is studied. For each of these types of interaction networks, we specify the convergence conditions in dependency on the corresponding model parameters.
We consider autocovariance operators of a stationary stochastic process on a Polish space that is embedded into a reproducing kernel Hilbert space. We investigate how empirical estimates of these operators converge along realizations of the process under various conditions. In particular, we examine ergodic and strongly mixing processes and obtain several asymptotic results as well as finite sample error bounds. We provide applications of our theory in terms of consistency results for kernel PCA with dependent data and the conditional mean embedding of transition probabilities. Finally, we use our approach to examine the nonparametric estimation of Markov transition operators and highlight how our theory can give a consistency analysis for a large family of spectral analysis methods including kernel-based dynamic mode decomposition.
We used transition path theory (TPT) to infer "reactive" pathways of floating marine debris trajectories. The TPT analysis was applied on a pollution-aware time-homogeneous Markov chain model constructed from trajectories produced by satellite-tracked undrogued buoys from the NOAA Global Drifter Program. The latter involved coping with the openness of the system in physical space, which further required an adaptation of the standard TPT setting. Directly connecting pollution sources along coastlines with garbage patches of varied strengths, the unveiled reactive pollution routes represent alternative targets for ocean cleanup efforts. Among our specific findings we highlight: constraining a highly probable pollution source for the Great Pacific Garbage Patch; characterizing the weakness of the Indian Ocean gyre as a trap for plastic waste; and unveiling a tendency of the subtropical gyres to export garbage toward the coastlines rather than to other gyres in the event of anomalously intense winds.
Long-lived flow patterns in the atmosphere such as weather fronts, mid-latitude blockings or tropical cyclones often induce extreme weather conditions. As a consequence, their description, detection, and tracking has received increasing attention in recent years. Similar objectives also arise in diverse fields such as turbulence and combustion research, image analysis, and medical diagnostics under the headlines of "feature tracking", "coherent structure detection" or "image registration" - to name just a few. A host of different approaches to addressing the underlying, often very similar, tasks have been developed and successfully used. Here, several typical examples of such approaches are summarized, further developed and applied to meteorological data sets. Common abstract operational steps form the basis for a unifying framework for the specification of "persistent structures" involving the definition of the physical state of a system, the features of interest, and means of measuring their persistence.
We present a numerical method to model dynamical systems from data. We use the recently introduced method Scalable Probabilistic Approximation (SPA) to project points from a Euclidean space to convex polytopes and represent these projected states of a system in new, lower-dimensional coordinates denoting their position in the polytope. We then introduce a specific nonlinear transformation to construct a model of the dynamics in the polytope and to transform back into the original state space. To overcome the potential loss of information from the projection to a lower-dimensional polytope, we use memory in the sense of the delay-embedding theorem of Takens. By construction, our method produces stable models. We illustrate the capacity of the method to reproduce even chaotic dynamics and attractors with multiple connected components on various examples.
We investigate opinion dynamics based on an agent-based model and are interested in predicting the evolution of the percentages of the entire agent population that share an opinion. Since these opinion percentages can be seen as an aggregated observation of the full system state, the individual opinions of each agent, we view this in the framework of the Mori–Zwanzig projection formalism. More specifically, we show how to estimate a nonlinear autoregressive model (NAR) with memory from data given by a time series of opinion percentages, and discuss its prediction capacities for various specific topologies of the agent interaction network. We demonstrate that the inclusion of memory terms significantly improves the prediction quality on examples with different network topologies.
Agent-based models are a natural choice for modeling complex social systems. In such models simple stochastic interaction rules for a large population of individuals on the microscopic scale can lead to emergent dynamics on the macroscopic scale, for instance a sudden shift of majority opinion or behavior. Here we are introducing a methodology for studying noise-induced tipping between relevant subsets of the agent state space representing characteristic configurations. Due to a large number of interacting individuals, agent-based models are high-dimensional, though usually a lower-dimensional structure of the emerging collective behaviour exists. We therefore apply Diffusion Maps, a non-linear dimension reduction technique, to reveal the intrinsic low-dimensional structure. We characterize the tipping behaviour by means of Transition Path Theory, which helps gaining a statistical understanding of the tipping paths such as their distribution, flux and rate. By systematically studying two agent-based models that exhibit a multitude of tipping pathways and cascading effects, we illustrate the practicability of our approach.