Metric Uniformization and Spectral Bounds for Graphs

Geometric and Functional Analysis

Volumn 21, Issue 5, 2011, Pages 1117-1143

  Kelner, Jonathan A ^a   Lee, James R ^b   Price, Gregory N ^c,d   Teng, Shang Hua ^e  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Washington   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d University of Southern California ^*  (United States)

^e University of Southern California   (United States)

Author keywords

Eigenvalues; excluded minors; planar graphs; spectral geometry

Indexed keywords

EID: 80053603441     PISSN: 1016443X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00039-011-0132-9     Document Type: Article

References (52)

1. M. Ajtai, V. Chvátal, M. Newborn, E. Szemerédi, Crossing-Free Subgraphs, Theory and Practice of Combinatorics: A Collection of Articles Honoring Anton Kotzig on the Occasion of His Sixtieth Birthday" (A. Kotzig, A. Rosa, G. Sabidussi, J. Turgeon, eds.), Annals of Discrete Mathematics 12, North-Holland, Amsterdam (1982).
2. Alon N.: Eigenvalues and expanders,. Combinatorica 6(2), 83-96 (1986).
3. Alon N., Kahale N.: A spectral technique for coloring random 3-colorable graphs,. SIAM Journal on Computing 26, 1733-1748 (1997).
4. 1, isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory Series B. 38, 73-88 (1985).
5. N. Alon, P. Seymour, R. Thomas, A separator theorem for graphs with an excluded minor and its applications, in "STOC'90: Proceedings of the 22nd annual ACM Symposium on Theory of Computing ACM (1990), 293-299.
6. C. J. Alpert, S.-Z. Yao, Spectral partitioning: the more eigenvectors, the better, in "DAC '95: Proceedings of the 32nd ACM/IEEE conference on Design automation, ACM (1995), 195-200.
7. B. Aspvall, J. R. Gilbert, Graph coloring using eigenvalue decomposition, Technical Report, Ithaca, NY, USA, 1983.
8. P. Biswal, J. R. Lee, S. Rao, Eigenvalue bounds, spectral partitioning, and metrical deformations via flows, J. ACM 57: 3 (2010), Art. 13, 23pp.
9. Boyd S., Vandenberghe L.: Convex Optimization. Cambridge University Press, Cambridge (2004).
10. Brin S., Page L., The anatomy of a large-scale hypertextual web search engine. Computer Networks 30: 1-7 (1998), 107-117.
11. Buser P., Seppälä M., Silhol R.: Triangulations and moduli spaces of Riemann surfaces with group actions,. Manuscripta Mathematica 8(2), 209-224 (1995).
12. P. K. Chan, M. D. F. Schlag, J. Y. Zien, Spectral k-way ratio-cut partitioning and clustering, in "DAC '93: Proceedings of the 30th international conference on Design automation", ACM (1993), 749-754.
13. T. F. Chan, J. R. Gilbert, S.-H. Teng, Geometric spectral partitioning, Xerox PARC, Tech. Report, 1994.
14. J. Cheeger, A lower bound for the smallest eigenvalue of the Laplacian, in "Problems in Analysis" (R. C. Gunning, ed.), Princeton University Press (1970), 195-199.
15. Chung F. R.: Diameters and eigenvalues,. J. Amer. Math. Soc. 2, 187-196 (1989).
16. Dodziuk J.: Finite-difference approach to the Hodge theory of harmonic forms,. American Journal of Mathematics 98(1), 79-104 (1976).
17. J. Dodziuk, V. K. Patodi, Riemannian structures and triangulations of manifolds, Journal of the Indian Mathematical Society (N. S. 40 (1976), 1-52.
18. Donath W. E., Hoffman A. J.: Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices,. IBM Technical Disclosure Bulletin 15, 938-944 (1972).
19. Donath W. E., Hoffman A. J.: Lower bounds for the partitioning of graphs,. J. Res. Develop. 17, 420-425 (1073).
20. Even G., Naor J., Rao S., Schieber B.: Divide-and-conquer approximation algorithms via spreading metrics,. J. ACM 47(4), 585-616 (2000).
21. J. Fakcharoenphol, K. Talwar, An improved decomposition theorem for graphs excluding a fixed minor, Proceedings of 6th Workshop on Approximation, Randomization, and Combinatorial Optimization, Springer Lecture Notes in Computer Science 2764 (2003), 36-46.
22. Fiedler M.: Algebraic connectivity of graphs,. Czechoslovak Mathematical Journal 23(98), 298-305 (1973).
23. Fiedler M.: Eigenvectors of acyclic matrices,. Czechoslovak Mathematical Journal 25(100), 607-618 (1975).
24. Fiedler M.: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory,. Czechoslovak Mathematical Journal 25(100), 619-633 (1975).
25. Gilbert J. R., Hutchinson J. P., Tarjan R. E.: A separation theorem for graphs of bounded genus,. Journal of Algorithms 5, 391-407 (1984).
26. A. Grigor'yan, S.-T. Yau, Decomposition of a metric space by capacitors, in "Proceedings of Symposia in Pure Mathematics (Special volume dedicated to L. Nirenberg)" 65 (1999), 39-75.
27. Hall K. M.: An r-dimensional quadratic placement algorithm,. Management Science 17, 219-229 (1970).
28. F. Harary, Graph Theory. Addison-Wesley, Reading, MA, 1994.
29. Hersch J.: Quatre propriétés isopérimétriques de membranes sphériques homogénes,. C. R. Acad. Sci. Paris Sér. A-B 270, A1645-A1648 (1970).
30. Kelner J. A.: Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus,. SIAM J. Comput. 35(4), 882-902 (2006).
31. P. Klein, S. A. Plotkin, S. Rao, Excluded minors, network decomposition, and multicommodity flow, in "STOC '93: Proceedings of the 25th Annual ACM Symposium on Theory of Computing", ACM (1993), 682-690.
32. Kleinberg J. M.: Authoritative sources in a hyperlinked environment,. Journal of the ACM. 46, 668-677 (1999).
33. Korevaar N.: Upper bounds for eigenvalues of conformal metrics,. J. Differential Geometry 37, 73-93 (1993).
34. Kostochka A. V.: The minimum Hadwiger number for graphs with a given mean degree of vertices,. Metody Diskret. Analiz. 38, 37-58 (1982).
35. Krauthgamer R., Lee J. R., Mendel M., Naor A.: Measured descent: a new embedding method for finite metrics,. Geom. funct. anal. 15(4), 839-858 (2005).
36. Lee J. R., Naor A.: Extending Lipschitz functions via random metric partitions,. Invent. Math. 160(1), 59-95 (2005).
37. J. R. Lee, A. Sidiropoulos, Genus and the geometry of the cut graph, Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA) (2010), 193-201.
38. F. T. Leighton, Complexity Issues in VLSI. MIT Press, 1983.
39. Lipton R. J., Tarjan R. E.: A separator theorem for planar graphs,. SIAM J. of Appl. Math. 36, 177-189 (1979).
40. Miller G. L., Teng S.-H., Thurston W., Vavasis S. A.: Geometric separators for finite-element meshes,. SIAM J. Sci. Comput. 19(2), 364-86 (1998) (electronic).
41. S. Rao, Small distortion and volume preserving embeddings for planar and Euclidean metrics, in"SCG '99: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, ACM (1999), 300-306.
42. Robertson N., Seymour P. D.: Graph minors. VIII. A Kuratowski theorem for general surfaces,. J. Combin. Theory Ser. B 48(2), 255-288 (1990).
43. Robertson N., Seymour P. D.: Graph minors. XX. Wagner's conjecture,. J. Combin. Theory Ser. B 92(2), 325-357 (2004).
44. Shi J., Malik J.: Normalized cuts and image segmentation,. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888-905 (2000).
45. Sinclair A. J., Jerrum M. R.: Approximative counting, uniform generation and rapidly mixing Markov chains,. Information and Computation 82(1), 93-133 (1989).
46. Spielman D. A., Teng S.-H.: Spectral partitioning works: planar graphs and finite element meshes,. Linear Algebra Appl. 421(2-3), 284-305 (2007).
47. Thomason A.: An extremal function for contractions of graphs,. Math. Proc. Cambridge Philos. Soc. 95(2), 261-265 (1984).
48. D. A. Tolliver, G. L. Miller, Graph partitioning by spectral rounding: Applications in image segmentation and clustering, in "CVPR '06: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition," IEEE Computer Society (2006), 1053-1060.
49. Tóth L. F.: Kreisausfüllungen der hyperbolischen ebene,. Acta Mathematica Hungarica 4(1), 103-110 (1953).
50. Wagner K.: Über eine Eigenschaft der ebenen Komplexe,. Math. Ann. 114(1), 570-590 (1937).
51. H. Whitney, Geometric Integration Theory, Princeton University Press, 1957.
52. Yang P., Yau S. T.: Eigenvalues of the Laplacian of compact Riemann surfaces and minimal submanifolds,. Ann. Scuola Norm. Sup. Pisa Cl. Sci. 4(7), 55-63 (1980).