Analyzing disturbed diffusion on networks

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

Volumn 4288 LNCS, Issue , 2006, Pages 429-438

  Meyerhenke, Henning ^a   Sauerwald, Thomas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Diffusion distance; Disturbed diffusion; Random walks

Indexed keywords

CONVERGENCE PROPERTIES; DIFFUSION DISTANCE; DISTANCE MEASURE; EDGE FLOW; GRAPH CLASS; GRAPH PARTITIONING; HYPER-CUBES; K-MEANS ALGORITHM; LOAD DISTRIBUTIONS; MACHINE-LEARNING; RANDOM WALK;

COMPUTATION THEORY;

DIFFUSION;

EID: 51049084808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_44     Document Type: Conference Paper

References (27)

1. J. Adámek. Foundations of Coding. J. Wiley & Sons, 1991.
2. N. Alon and J. H. Spencer. The Probabilistic Method. J. Wiley & Sons, 2nd edition, 2000.
3. N. Biggs. Algebraic Graph Theory. Cambridge University Press, 1993.
4. R. R. Coifman, S. Lafon, A. B. Lee, M. Maggioni, B. Nadler, F. Warner, and S. W. Zucker. Geometric diffusions as a tool for harmonic analysis and structure definition of data. Parts I and II. Proc. Natl. Academy of Sciences, 102(21):7426-7437, 2005.
5. G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Parallel and Distributed Computing, 7:279-301, 1989.
6. R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25(7):789-812, 1999.
7. P. G. Doyle and J. L. Snell. Random Walks and Electric Networks. Math. Assoc, of America, 1984.
8. R. B. Ellis. Discrete green's functions for products of regular graphs. In AMS National Conference, invited talk, special session on Graph Theory, 2001.
9. G. R. Grimmett and D. R. Stirzaker. Probability and Random Processes. Oxford University Press, second edition, 1992.
10. J. L. Gross and J. Yellen (eds.). Handbook of Graph Theory. CRC Press, 2004.
11. Y. F. Hu and R. F. Blake. An improved diffusion algorithm for dynamic load balancing. Parallel Computing, 25 (4):417-444, 1999.
12. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Springer-Verlag, 1976.
13. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
14. Stuart P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2):129-136, 1982.
15. L. Lovász. Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty, 2:1-46, 1993.
16. M. Meila and J. Shi. A random walks view of spectral segmentation. In Eighth International Workshop on Artificial Intelligence and Statistics (AISTATS), 2001.
17. H. Meyerhenke, B. Monien, and S. Schamberger. Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. In Proc. 20th IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS'06), page 57 (CD). IEEE, 2006.
18. B. Nadler, S. Lafon, R. R. Coifman, and I. G. Kevrekidis. Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators. In NIPS, 2005.
19. M. Saerens, P. Dupont, F. Fouss, and L. Yen. The principal components analysis of a graph, and its relationships to spectral clustering. In ECML 2004, European Conference on Machine Learning, pages 371-383, 2004.
20. S. Schamberger. A shape optimizing load distribution heuristic for parallel adaptive FEM computations. In Parallel Computing Technologies, PACT'05, number 2763 in LNCS, pages 263-277, 2005.
21. J. R. Shewchuk. An introduction to the conjugate gradient method without the agonizing pain. Technical Report CMU-CS-94-125, Carnegie Mellon University, 1994.
22. The BlueGene/L Team. An overview of the BlueGene/L supercomputer. In Proc. ACM/IEEE Conf. on Supercomputing, pages 1-22, 2002.
23. N. Tishby and N. Slonim. Data clustering by markovian relaxation and the information bottleneck method. In NIPS, pages 640-646, 2000.
24. U. Trottenberg, C. W. Oosterlee, and A. Schüller. Multigrid. Academic Press, 2000.
25. S. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, Univ. of Utrecht, 2000.
26. C. Xu and F. C. M. Lau. Load Balancing in Parallel Computers. Kluwer, 1997.
27. L. Yen, D. Vanvyve, F. Wouters, F. Fouss, M. Verleysen, and M. Saerens. Clustering using a random-walk based distance measure. In ESANN 2005, European Symposium on Artificial Neural Networks, 2005.