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 条
  • [1] Relations Between Adjacency and Modularity Graph Partitioning
    Jiang, Hansi
    Meyer, Carl
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2023, PT II, 2023, 13936 : 189 - 200
  • [2] Using graph partitioning for efficient network modularity optimization
    Djidjev, Hristo
    Onus, Melih
    GRAPH PARTITIONING AND GRAPH CLUSTERING, 2013, 588 : 103 - +
  • [3] A Novel Similarity-based Modularity Function for Graph Partitioning
    Feng, Zhidan
    Xu, Xiaowei
    Yuruk, Nurcan
    Schweiger, Thomas
    CLUSTER CHALLENGES IN BIOLOGICAL NETWORKS, 2009, : 223 - +
  • [4] A novel similarity-based modularity function for graph partitioning
    Feng, Zhidan
    Xu, Xiaowei
    Yuruk, Nurcan
    Schweiger, Thomas A. J.
    DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2007, 4654 : 385 - 396
  • [5] PARTITIONING ACYCLIC STOCHASTIC PRECEDENCE GRAPH
    CHAKRAVARTY, AK
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1981, 12 (01): : 41 - 54
  • [6] Modularity-based graph partitioning using conditional expected models
    Chang, Yu-Teng
    Leahy, Richard M.
    Pantazis, Dimitrios
    PHYSICAL REVIEW E, 2012, 85 (01)
  • [7] RNA Graph Partitioning for the Discovery of RNA Modularity: A Novel Application of Graph Partition Algorithm to Biology
    Kim, Namhee
    Zheng, Zhe
    Elmetwaly, Shereef
    Schlick, Tamar
    PLOS ONE, 2014, 9 (09):
  • [8] Multirobot Stochastic Patrolling via Graph Partitioning
    Wang, Weizhen
    Duan, Xiaoming
    He, Jianping
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2025, 12 (01): : 300 - 312
  • [9] Stochastic model for adaptation using basin hopping dynamics
    Davis, Peter
    2007 IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTATIONAL INTELLIGENCE, VOLS 1 AND 2, 2007, : 180 - 185
  • [10] On the Two-Stage Stochastic Graph Partitioning Problem
    Fan, Neng
    Zheng, Qipeng P.
    Pardalos, Panos M.
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 500 - +