Identifying stochastic basin hopping by partitioning with graph modularity

被引:13
|
作者
Santitissadeekorn, N. [1 ]
Bollt, E. M. [1 ]
机构
[1] Clarkson Univ, Dept Math & Comp Sci, Potsdam, NY 13699 USA
关键词
multistability; graph modularity; noise; basin hopping; Frobenius-Perron operator; stochastic; Ulam's method; phase space partition;
D O I
10.1016/j.physd.2007.04.008
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
It has been known that noise in a stochastically perturbed dynamical system can destroy what was the original zero-noise case barriers in the phase space (pseudobarrier). Noise can cause the basin hopping. We use the Frobenius-Perron operator and its finite rank approximation by the Ulam-Galerkin method to study transport mechanism of a noisy map. In order to identify the regions of high transport activity in the phase space and to determine flux across the pseudobarriers, we adapt a new graph theoretical method which was developed to detect active pseudobarriers in the original phase space of the stochastic dynamic. Previous methods to identify basins and basin barriers require a priori knowledge of a mathematical model of the system, and hence cannot be applied to observed time series data of which a mathematical model is not known. Here we describe a novel graph method based on optimization of the modularity measure of a network and introduce its application for determining pseudobarriers in the phase space of a multi-stable system only known through observed data. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:95 / 107
页数:13
相关论文
共 50 条
  • [41] Balanced graph partitioning
    Andreev, Konstantin
    Raecke, Harald
    THEORY OF COMPUTING SYSTEMS, 2006, 39 (06) : 929 - 939
  • [42] PARTITIONING THE EDGES OF A GRAPH
    HILTON, AJW
    JONES, RP
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 25 (03) : 290 - 294
  • [43] GRAPH PARTITIONING BY EIGENVECTORS
    POWERS, DL
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1988, 101 : 121 - 133
  • [44] On the Clique Partitioning of a Graph
    M. Sh. Levin
    Journal of Communications Technology and Electronics, 2022, 67 : S267 - S274
  • [45] ALGORITHMS FOR PARTITIONING A GRAPH
    PARK, T
    LEE, CY
    COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 28 (04) : 899 - 909
  • [46] Multiset graph partitioning
    Hager, WW
    Krylyuk, Y
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2002, 55 (01) : 1 - 10
  • [47] Multiset graph partitioning
    William W. Hager
    Yaroslav Krylyuk
    Mathematical Methods of Operations Research, 2002, 55 : 1 - 10
  • [48] Hierarchical Graph Partitioning
    Hajiaghayi, Mohammadtaghi
    Johnson, Theodore
    Khan, Mohammad Reza
    Saha, Barna
    PROCEEDINGS OF THE 26TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'14), 2014, : 51 - 60
  • [49] Unbalanced Graph Partitioning
    Li, Angsheng
    Zhang, Peng
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 218 - +
  • [50] Unbalanced Graph Partitioning
    Li, Angsheng
    Zhang, Peng
    THEORY OF COMPUTING SYSTEMS, 2013, 53 (03) : 454 - 466