Browse
Submit Data
Databases
API
Help

Dataset Information

24 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Efficient simulation of non-Markovian dynamics on complex networks.

ABSTRACT: We study continuous-time multi-agent models, where agents interact according to a network topology. At any point in time, each agent occupies a specific local node state. Agents change their state at random through interactions with neighboring agents. The time until a transition happens can follow an arbitrary probability density. Stochastic (Monte-Carlo) simulations are often the preferred-sometimes the only feasible-approach to study the complex emerging dynamical patterns of such systems. However, each simulation run comes with high computational costs mostly due to updating the instantaneous rates of interconnected agents after each transition. This work proposes a stochastic rejection-based, event-driven simulation algorithm that scales extremely well with the size and connectivity of the underlying contact network and produces statistically correct samples. We demonstrate the effectiveness of our method on different information spreading models.

SUBMITTER: Großmann G

PROVIDER: S-EPMC7598478 | biostudies-literature | 2020

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Efficient simulation of non-Markovian dynamics on complex networks.

Großmann Gerrit G Bortolussi Luca L Wolf Verena V

PloS one 20201030 10

We study continuous-time multi-agent models, where agents interact according to a network topology. At any point in time, each agent occupies a specific local node state. Agents change their state at random through interactions with neighboring agents. The time until a transition happens can follow an arbitrary probability density. Stochastic (Monte-Carlo) simulations are often the preferred-sometimes the only feasible-approach to study the complex emerging dynamical patterns of such systems. Ho ...[more]

PMID: 33125408

Similar Datasets

Equivalence and its invalidation between non-Markovian and Markovian spreading dynamics on complex networks.

Project description:Epidemic spreading processes in the real world depend on human behaviors and, consequently, are typically non-Markovian in that the key events underlying the spreading dynamics cannot be described as a Poisson random process and the corresponding event time is not exponentially distributed. In contrast to Markovian type of spreading dynamics for which mathematical theories have been well developed, we lack a comprehensive framework to analyze and fully understand non-Markovian spreading processes. Here we develop a mean-field theory to address this challenge, and demonstrate that the theory enables accurate prediction of both the transient phase and the steady states of non-Markovian susceptible-infected-susceptible spreading dynamics on synthetic and empirical networks. We further find that the existence of equivalence between non-Markovian and Markovian spreading depends on a specific edge activation mechanism. In particular, when temporal correlations are absent on active edges, the equivalence can be expected; otherwise, an exact equivalence no longer holds.

| S-EPMC6707263 | biostudies-literature

Linear optics simulation of quantum non-Markovian dynamics.

Project description:The simulation of open quantum dynamics has recently allowed the direct investigation of the features of system-environment interaction and of their consequences on the evolution of a quantum system. Such interaction threatens the quantum properties of the system, spoiling them and causing the phenomenon of decoherence. Sometimes however a coherent exchange of information takes place between system and environment, memory effects arise and the dynamics of the system becomes non-Markovian. Here we report the experimental realisation of a non-Markovian process where system and environment are coupled through a simulated transverse Ising model. By engineering the evolution in a photonic quantum simulator, we demonstrate the role played by system-environment correlations in the emergence of memory effects.

| S-EPMC3520028 | biostudies-literature

Efficient non-Markovian quantum dynamics using time-evolving matrix product operators.

Project description:In order to model realistic quantum devices it is necessary to simulate quantum systems strongly coupled to their environment. To date, most understanding of open quantum systems is restricted either to weak system-bath couplings or to special cases where specific numerical techniques become effective. Here we present a general and yet exact numerical approach that efficiently describes the time evolution of a quantum system coupled to a non-Markovian harmonic environment. Our method relies on expressing the system state and its propagator as a matrix product state and operator, respectively, and using a singular value decomposition to compress the description of the state as time evolves. We demonstrate the power and flexibility of our approach by numerically identifying the localisation transition of the Ohmic spin-boson model, and considering a model with widely separated environmental timescales arising for a pair of spins embedded in a common environment.

| S-EPMC6102262 | biostudies-other

Non-Markovian recovery makes complex networks more resilient against large-scale failures.

Project description:Non-Markovian spontaneous recovery processes with a time delay (memory) are ubiquitous in the real world. How does the non-Markovian characteristic affect failure propagation in complex networks? We consider failures due to internal causes at the nodal level and external failures due to an adverse environment, and develop a pair approximation analysis taking into account the two-node correlation. In general, a high failure stationary state can arise, corresponding to large-scale failures that can significantly compromise the functioning of the network. We uncover a striking phenomenon: memory associated with nodal recovery can counter-intuitively make the network more resilient against large-scale failures. In natural systems, the intrinsic non-Markovian characteristic of nodal recovery may thus be one reason for their resilience. In engineering design, incorporating certain non-Markovian features into the network may be beneficial to equipping it with a strong resilient capability to resist catastrophic failures.

| S-EPMC7237476 | biostudies-literature

Markovian and Non-Markovian Modeling of Membrane Dynamics with Milestoning.

Project description:We exploit atomically detailed simulations and the milestoning theory to extract coarse grained models of membrane kinetics and thermodynamics. Non-Markovian and Markovian theories for the phosphate group displacements are used to coarsely represent membrane motions. The construction of the two models makes it possible to examine their consistency and accuracy. The equilibrium and fluctuations of the phosphate groups along the normal to the membrane plane are estimated, and milestoning equations are constructed and solved. An optimal Markovian model is constructed that reproduces exactly the equilibrium and mean first passage time (MFPT) of the non-Markovian model. The equilibrium solution of both models is favorably compared to distributions obtained from straightforward molecular dynamics simulations. The picture for the kinetics is complex. Multiple local relaxation times of the mass density are illustrated emphasizing the non-Markovian characteristics of the process. In Markovian modeling, only a single relaxation time is assumed for a state. Mapping of particle dynamics to the dynamics of a field density offers a new way of coarse graining complex systems as membranes that may bridge between atomically detailed models and phenomenological descriptions of macroscopic membranes.

| S-EPMC5001947 | biostudies-other

Accelerated Estimation of Long-Timescale Kinetics from Weighted Ensemble Simulation via Non-Markovian "Microbin" Analysis.

Project description:The weighted ensemble (WE) simulation strategy provides unbiased sampling of nonequilibrium processes, such as molecular folding or binding, but the extraction of rate constants relies on characterizing steady-state behavior. Unfortunately, WE simulations of sufficiently complex systems will not relax to steady state on observed simulation times. Here, we show that a postsimulation clustering of molecular configurations into "microbins" using methods developed in the Markov State Model (MSM) community can yield unbiased kinetics from WE data before steady-state convergence of the WE simulation itself. Because WE trajectories are directional and not equilibrium distributed, the history-augmented MSM (haMSM) formulation can be used, which yields the mean first-passage time (MFPT) without bias for arbitrarily small lag times. Accurate kinetics can be obtained while bypassing the often prohibitive convergence requirements of the nonequilibrium weighted ensemble. We validate the method in a simple diffusive process on a two-dimensional (2D) random energy landscape and then analyze atomistic protein folding simulations using WE molecular dynamics. We report significant progress toward the unbiased estimation of protein folding times and pathways, though key challenges remain.

| S-EPMC8045600 | biostudies-literature

An exact relationship between invasion probability and endemic prevalence for Markovian SIS dynamics on networks.

Project description:Understanding models which represent the invasion of network-based systems by infectious agents can give important insights into many real-world situations, including the prevention and control of infectious diseases and computer viruses. Here we consider Markovian susceptible-infectious-susceptible (SIS) dynamics on finite strongly connected networks, applicable to several sexually transmitted diseases and computer viruses. In this context, a theoretical definition of endemic prevalence is easily obtained via the quasi-stationary distribution (QSD). By representing the model as a percolation process and utilising the property of duality, we also provide a theoretical definition of invasion probability. We then show that, for undirected networks, the probability of invasion from any given individual is equal to the (probabilistic) endemic prevalence, following successful invasion, at the individual (we also provide a relationship for the directed case). The total (fractional) endemic prevalence in the population is thus equal to the average invasion probability (across all individuals). Consequently, for such systems, the regions or individuals already supporting a high level of infection are likely to be the source of a successful invasion by another infectious agent. This could be used to inform targeted interventions when there is a threat from an emerging infectious disease.

| S-EPMC3728314 | biostudies-literature

Efficient communication over complex dynamical networks: The role of matrix non-normality.

Project description:In both natural and engineered systems, communication often occurs dynamically over networks ranging from highly structured grids to largely disordered graphs. To use, or comprehend the use of, networks as efficient communication media requires understanding of how they propagate and transform information in the face of noise. Here, we develop a framework that enables us to examine how network structure, noise, and interference between consecutive packets jointly determine transmission performance in complex networks governed by linear dynamics. Mathematically, normal networks, which can be decomposed into separate low-dimensional information channels, suffer greatly from readout noise. Most details of their wiring have no impact on transmission quality. Non-normal networks, however, can largely cancel the effect of noise by transiently amplifying select input dimensions while ignoring others, resulting in higher net information throughput. Our theory could inform the design of new communication networks, as well as the optimal use of existing ones.

| S-EPMC7253166 | biostudies-literature

Markovian and non-Markovian protein sequence evolution: aggregated Markov process models.

Project description:Over the years, there have been claims that evolution proceeds according to systematically different processes over different timescales and that protein evolution behaves in a non-Markovian manner. On the other hand, Markov models are fundamental to many applications in evolutionary studies. Apparent non-Markovian or time-dependent behavior has been attributed to influence of the genetic code at short timescales and dominance of physicochemical properties of the amino acids at long timescales. However, any long time period is simply the accumulation of many short time periods, and it remains unclear why evolution should appear to act systematically differently across the range of timescales studied. We show that the observed time-dependent behavior can be explained qualitatively by modeling protein sequence evolution as an aggregated Markov process (AMP): a time-homogeneous Markovian substitution model observed only at the level of the amino acids encoded by the protein-coding DNA sequence. The study of AMPs sheds new light on the relationship between amino acid-level and codon-level models of sequence evolution, and our results suggest that protein evolution should be modeled at the codon level rather than using amino acid substitution models.

| S-EPMC3157587 | biostudies-literature

Detecting Allosteric Networks Using Molecular Dynamics Simulation.

Project description:Allosteric networks allow enzymes to transmit information and regulate their catalytic activities over vast distances. In principle, molecular dynamics (MD) simulations can be used to reveal the mechanisms that underlie this phenomenon; in practice, it can be difficult to discern allosteric signals from MD trajectories. Here, we describe how MD simulations can be analyzed to reveal correlated motions and allosteric networks, and provide an example of their use on the coagulation enzyme thrombin. Methods are discussed for calculating residue-pair correlations from atomic fluctuations and mutual information, which can be combined with contact information to identify allosteric networks and to dynamically cluster a system into highly correlated communities. In the case of thrombin, these methods show that binding of the antagonist hirugen significantly alters the enzyme's correlation landscape through a series of pathways between Exosite I and the catalytic core. Results suggest that hirugen binding curtails dynamic diversity and enforces stricter venues of influence, thus reducing the accessibility of thrombin to other molecules.

| S-EPMC5492730 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data