Detecting and Locating Near-Optimal Almost-Invariant Sets and Cycles
Top Cited Papers
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 24 (6) , 1839-1863
- https://doi.org/10.1137/s106482750238911x
Abstract
The behaviors of trajectories of nonlinear dynamical systems are notoriously hard to characterize and predict. Rather than characterizing dynamical behavior at the level of trajectories, we consider following the evolution of sets. There are often collections of sets that behave in a very predictable way, in spite of the fact that individual trajectories are entirely unpredictable. Such special collections of sets are invisible to studies of long trajectories. We describe a global set-oriented method to detect and locate these large dynamical structures. Our approach is a marriage of new ideas in modern dynamical systems theory and the novel application of graph dissection algorithms.Keywords
This publication has 17 references indexed in Scilit:
- Identification of almost invariant aggregates in reversible nearly uncoupled Markov chainsLinear Algebra and its Applications, 2000
- Spectral partitioning with multiple eigenvectorsDiscrete Applied Mathematics, 1999
- On the Approximation of Complicated Dynamical BehaviorSIAM Journal on Numerical Analysis, 1999
- Random perturbations of chaotic dynamical systems: stability of the spectrumNonlinearity, 1998
- Approximating physical invariant measures of mixing dynamical systems in higher dimensionsNonlinear Analysis, 1998
- Computer-Assisted Bounds for the Rate of Decay of CorrelationsCommunications in Mathematical Physics, 1997
- Spectral K-way ratio-cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Convergence theory for fuzzy c-means: Counterexamples and repairsIEEE Transactions on Systems, Man, and Cybernetics, 1987
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryCzechoslovak Mathematical Journal, 1975
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973