Congestion and almost invariant sets in dynamical systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2630, Issue , 2003, Pages 183-209

  Dellnitz, Michael ^a   Preis, Robert ^a,b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MOLECULES; NUMERICAL METHODS;

ALGORITHMIC METHODS; ALMOST-INVARIANT SETS; COMPUTATIONAL RESULTS; DYNAMICAL BEHAVIORS; GRAPH-THEORETIC METHODS; MACROSCOPIC BEHAVIORS; SPECTRAL INFORMATION; TRANSITION MATRICES;

DYNAMICAL SYSTEMS;

EID: 35248864524     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45084-x_8     Document Type: Article

References (44)

1. N. Alon. On the edge-expansion of graphs. Combinatorics, Probability and Computing, 6:145-152, 1997.
2. S.L. Bezroukov, R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich. New spectral lower bounds on the bisection width of graphs. In Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 1928, pages 23-34, 2000.
3. N. Bouhmala. Impact of different graph coarsening schemes on the quality of the partitions. Technical Report RT98/05-01, University of Neuchatel, Department of Computer Science, 1998.
4. F.R.K. Chung. Spectral Graph Theory, volume 92 of CBMS Regional conference series in mathematics. American Mathematical Society, 1997.
5. T.H. Cormen, C.B. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, 1990.
6. M. Dellnitz and A. Hohmann. A subdivision algorithm for the computation of unstable manifolds and global attractors. Numerische Mathematik, 75:293-317, 1997.
7. M. Dellnitz and O. Junge. On the approximation of complicated dynamical behavior. SIAM J. Numer. Anal., 36(2):491-515, 1999.
8. P. Deuflhard, M. Dellnitz, O. Junge, and Ch. Schütte. Computation of essential molecular dynamics by subdivision techniques. In Deuflhard et al., editor, Computational Molecular Dynamics: Challenges, Methods, Ideas, LNCSE 4, 1998.
9. P. Deuflhard, W. Huisinga, A. Fischer, and Ch. Schütte. Identification of almost invariant aggregates in reversible nearly uncoupled markov chains. Lin. Alg. Appl., 315:39-59, 2000.
10. R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25(7):789-812, 1999.
11. R. Diekmann, B. Monien, and R. Preis. Using helpful sets to improve graph bisections. In D.F. Hsu, A.L. Rosenberg, and D. Sotteau, editors, Interconnection Networks and Mapping and Scheduling Parallel Computations, volume 21 of DI-MACS Series in Discrete Mathematics and Theoretical Computer Science, pages 57-73. AMS, 1995.
12. R. Elsässer, A. Frommer, B. Monien, and R. Preis. Optimal and alternating-direction Ioadbalancing schemes. In P. Amestoy et al., editor, Euro-Par'99 Parallel Processing, LNCS 1685, pages 280-290, 1999.
13. R. Elsässer, T. Lücking, and B. Monien. New spectral bounds on k-partitioning of graphs. In Proc. of the Symposium on Parallel Algorithms and Architectures (SPAA), pages 255-270, 2001.
14. R. Elsässer, B. Monien, and R. Preis. Diffusive load balancing schemes on heterogeneous networks. In 12th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 30-38, 2000.
15. C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. IEEE Design Automation Conf., pages 175-181, 1982.
16. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical J., Praha, 25(100):619-633, 1975.
17. A. Fischer, Ch. Schütte, P. Deuflhard, and F. Cordes. Hierarchical uncoupling-coupling of metastable conformations. In Schlick and Gan, editors, Proc. of the 3rd International Workshop on Algorithms for Macromolecular Modeling, LNCSE 24, 2002.
18. G. Froyland and M. Dellnitz. Detecting and locating near-optimal almost-invariant sets and cycles. Technical report, DFG-Priority Program 1095: "Analysis, Modeling and Simulation of Multiscale Problems", 2001.
19. G. Froyland and M. Dellnitz. μ almost-invariant sets and adaptive boundary refinement, manuscript, 2003.
20. M.R. Garey and D.S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freemann, 1979.
21. A. Gupta. Fast and effective algorithms for graph partitioning and sparse matrix reordering. IBM J. of Research and Development, 41:171-183, 1997.
22. B. Hendrickson and R. Leland. The chaco user's guide: Version 2.0. Technical Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, 1994.
23. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Proc. Supercomputing '95. ACM, 1995.
24. J. Hromkovic and B. Monien. The bisection problem for graphs of degree 4 (configuring transputer systems). In Buchmann, Ganzinger, and Paul, editors, Festschrift zum 60. Geburtstag von Günter Hotz, pages 215-234. Teubner, 1992.
25. W. Huisinga. Metastability of Markovian systems. Phd thesis, Freie Universität Berlin, 2001.
26. G. Karypis and V. Kumar. METIS Manual, Version 4.0. University of Minnesota, Department of Computer Science, 1998.
27. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. J. of Parallel and Distributed Computing, 48:96-129, 1998.
28. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. on Scientific Computing, 20(1), 1999.
29. B.W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. The Bell Systems Technical J., pages 291-307, 1970.
30. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
31. B. Mohar. Some applications of laplace eigenvalues of graphs. In Graph Symmetry: Algebraic Methods and Applications, NATO ASI Ser. C 497, pages 225-275, 1997.
32. B. Monien and R. Diekmann. A local graph partitioning heuristic meeting bisection bounds. In 8th SIAM Conf. on Parallel Processing for Scientific Computing, 1997.
33. B. Monien and R. Preis. Bisection width of 3- and 4-regular graphs. In 26th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 2136, pages 524-536, 2001.
34. B. Monien, R. Preis, and R. Diekmann. Quality matching and local improvement for multilevel graph-partitioning. Parallel Computing, 26(12):1609-1634, 2000.
35. F. Pellegrini. SCOTCH 3.1 user's guide. Technical Report 1137-96, LaBRI, University of Bordeaux, 1996.
36. R. Ponnusamy, N. Mansour, A. Choudhary, and G.C. Fox. Graph contraction for mapping data on parallel computers: A quality-cost tradeoff. Scientific Programming, 3:73-82, 1994.
37. A. Pothen, H.D. Simon, and K.P. Liu. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. on Matrix Analysis and Applications, 11(3):430-452, 1990.
38. R. Preis. The PARTY Graphpartitioning-Library, User Manual - Version 1.99. Universität Paderborn, Germany, 1998.
39. R. Preis. Analyses and Design of Efficient Graph Partitioning Methods. Heinz . Nixdorf Institut Verlagsschriftenreihe, 2000. Dissertation, Universität Paderborn, Germany.
40. Ch. Schütte. Conformational Dynamics: Modelling, Theory, Algorithm, and Application to Biomolecules. Habilitation thesis, Freie Universität Berlin, 1999.
41. N. Sensen. Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows. In Proc. European Symposium on Algorithms (ESA), LNCS 2161, pages 391-403, 2001.
42. H.D. Simon and S.-H. Teng. How good is recursive bisection? SIAM J. on Scientific Computing, 18(5):1436-1445, 1997.
43. A. Sinclair. Algorithms for Random Generation & Counting: A Markov Chain Approach. Progress in Theoretical Computer Science. Birkhäuser, 1993.
44. C. Walshaw. The Jostle user manual: Version 2.2. University of Greenwich, 2000.