2019
DOI: 10.3934/dcdsb.2019122
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic dynamics Ⅱ: Finite random dynamical systems, linear representation, and entropy production

Abstract: We study finite state random dynamical systems (RDS) and their induced Markov chains (MC) as stochastic models for complex dynamics. The linear representation of deterministic maps in RDS is a matrix-valued random variable whose expectation corresponds to the transition matrix of the MC. The instantaneous Gibbs entropy, Shannon-Khinchin entropy of a step, and the entropy production rate of the MC are discussed. These three concepts, as key anchoring points in applications of stochastic dynamics, characterize r… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 42 publications
0
6
0
Order By: Relevance
“…However, the general structure of the proof may well be extended to more general chemical reaction networks, also with multiple reactants and corresponding random periodic orbits. Note that the works [16,35,36] mentioned earlier also deal with synchronization of RDSs for Markov chains, and in [16] even partial synchronization is considered. However, the latter approach is focused on linear cocycles for random networks, using the theory of Lyapunov exponents.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…However, the general structure of the proof may well be extended to more general chemical reaction networks, also with multiple reactants and corresponding random periodic orbits. Note that the works [16,35,36] mentioned earlier also deal with synchronization of RDSs for Markov chains, and in [16] even partial synchronization is considered. However, the latter approach is focused on linear cocycles for random networks, using the theory of Lyapunov exponents.…”
Section: Resultsmentioning
confidence: 99%
“…For a discrete-time system on a finite state space the maps are given by deterministic transitions matrices (containing only entries zero and one), and the expectation of the matrix-valued random variable of transitions maps agrees with the stochastic transition matrix of the corresponding Markov chain. The relation between such finite-state RDS and the related Markov chains has been studied by F. Ye et al [35,36]. Among other things, it has been found that a given finite-state RDS induces a unique Markov chain, while one Markov chain might be compatible with several RDS [36], as already discussed in a general context by Kifer [18].…”
Section: Background and Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In our change-of-measure formalism, we could extend (Ω, F) to include all possible transition matrices. Such future work could be conducted by considering the theories of random dynamical system for Markov chains [66,67]. very definition: (1) containing the empty set ∅ where nothing happen, (2) being closed under countable union, and (3) being closed under complement.…”
Section: Housekeeping Heat and Non-adiabatic Entropy Productionmentioning
confidence: 99%
“…Physics, engineering, and sciences of complex systems and processes often encounter network dynamics that are subject to uncertainties from "individuals" in a population but also to random influences from the surrounding environment, referred to respectively as intrinsic and extrinsic noise. While the former is often due to internal complexities of the individuals one studies, the latter reflects the unpredictable world one lives in [9,15,16]. This paper proposes and develops the theory of Markov random networks as an appropriate conceptual framework that distinguishes intrinsic and extrinsic noise and incorporates them into a dynamic theory.…”
Section: Introductionmentioning
confidence: 99%