2016
DOI: 10.1137/15m1032272
|View full text |Cite
|
Sign up to set email alerts
|

Finding Dominant Structures of Nonreversible Markov Processes

Abstract: Finding metastable sets as dominant structures of Markov processes has been shown to be especially useful in modeling interesting slow dynamics of various real world complex processes. Furthermore, coarse graining of such processes based on their dominant structures leads to better understanding and dimension reduction of observed systems. However, in many cases, e.g. for nonreversible Markov processes, dominant structures are often not formed by metastable sets but by important cycles or mixture of both. This… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(18 citation statements)
references
References 34 publications
0
18
0
Order By: Relevance
“…Here it is not the case, and we symmetrize the matrix for simplicity. A more refined approach would be to use a Schur decomposition of the TM instead of a direct diagonalization, as was proposed in [15] and performed in detail in [16]. As results are already satisfying here, we kept with standard PCCA+: this simply overestimates some rates of exchange, and make the rates of staying in a microstate relatively smaller.…”
Section: Figmentioning
confidence: 99%
See 1 more Smart Citation
“…Here it is not the case, and we symmetrize the matrix for simplicity. A more refined approach would be to use a Schur decomposition of the TM instead of a direct diagonalization, as was proposed in [15] and performed in detail in [16]. As results are already satisfying here, we kept with standard PCCA+: this simply overestimates some rates of exchange, and make the rates of staying in a microstate relatively smaller.…”
Section: Figmentioning
confidence: 99%
“…A well established approach for that is the (Robust) Perron Cluster Cluster Analysis (PCCA+) [11,12] (see also SI 2.1 and [14]). Assuming for simplicity to forget the non-equilibrium breaking of detailed balance (thus building a symmetrical approximate TM, see SI 2.1 and [15,16] for refinements), we find that relevant macrostates can be reduced from n c ∼ 100 down to as little asñ c = 6. Moreover, whereas n c grows with system size L,ñ c = 6 is much more stable against L: we find a consistent description of the system withñ c = 6 also for L = 15 and L = 20, and the detection of the optimalñ c robustly yieldsñ c ∈ [5, 9] (see SI, Figs.…”
mentioning
confidence: 99%
“…Such groups of nodes may accordingly be seen as communities within the network, which are here to be understood in a dynamical, rather than a structural fashion. Similar ideas have also been put forward in Banisch and Conrad (2015) and Conrad, Weber, and Schütte (2016), where communities are defined as those directed graph structures that retain probability flow over long time scales, and thus are associated to a separation of time scales in the network. The Markov stability framework, which we discuss in detail in Chapter 6, provides another example for exploiting this kind of time scale separation phenomena to define community structure in networks.…”
Section: Time Scale Separations On Directed Networkmentioning
confidence: 83%
“…Since the system is much larger this time, we want to group cells together which are dynamically close by means of a clustering algorithm such as the well-known fuzzy clustering method PCCA+ [52] which stands for Robust Perron Cluster Cluster Anal-ysis. We will use PCCA+ for non-reversible processes [14,16,51], implemented in [61], which takes the dominant real Schur vectors of the transition matrix and by a linear transformation maps them into a set of non-negative membership vectors that form a partition of unity and are as crisp as possible. Other optimization criteria also exist [52].…”
Section: Tipping Analysis Of the Abmsmentioning
confidence: 99%