1. Geometry of Infinite Graphs Jim Belk Bard College

2. A graph is a set vertices connected by edges. Graphs This graph is finite, since there are a finite number of vertices.

3. This graph is infinite. Graphs

4. So are these. Graphs square gridcubical grid

5. And these. Graphs infinite honeycombinfinite tree

6. Geometry of Graphs infinite honeycomb Central Argument: It is possible to do geometry just with graphs!

7. The most familiar kind of geometry is Euclidean geometry. Euclidean Geometry    Euclidean Plane

8. The most familiar kind of geometry is Euclidean geometry. Geometry    Euclidean PlaneSquare Grid

9. The most familiar kind of geometry is Euclidean geometry. Geometry    Euclidean PlaneSquare Grid

10. The most familiar kind of geometry is Euclidean geometry. Geometry    Euclidean PlaneSquare Grid

11. Example: The Isoperimetric Problem

12. Let  be a region in the plane. The Isoperimetric Problem  Given: perimeter      Question: What is the maximum possible area of  ?

13. Let  be a region in the plane. The Isoperimetric Problem  Given: perimeter       Isoperimetric Theorem The maximum area occurs when  is a circle. Question: What is the maximum possible area of  ?

14. Let  be a region in the plane. The Isoperimetric Problem  Isoperimetric Theorem The maximum area occurs when  is a circle.

15. Isoperimetric Inequality Let  be a region in the plane. The Isoperimetric Problem  Isoperimetric Theorem The maximum area occurs when  is a circle. 

16. The Isoperimetric Problem Circle Double Bubble

17. The Isoperimetric Problem Quadratic In the plane, area is a quadratic function of perimeter.

18. On the Grid

19. Some Definitions A region in the grid is any finite set of vertices. The area is just the number of vertices.

20. Some Definitions The perimeter is the number of boundary edges. A region in the grid is any finite set of vertices. The area is just the number of vertices.

21. Some Definitions The perimeter is the number of boundary edges. A region in the grid is any finite set of vertices. The area is just the number of vertices.

22. Some Definitions The perimeter is the number of boundary edges. A region in the grid is any finite set of vertices. The area is just the number of vertices.

23. Isoperimetric Theorem Theorem For the infinite grid:

24. Isoperimetric Theorem Theorem For the infinite grid:  Square

25. Isoperimetric Theorem Theorem For the infinite grid:  Square Quadratic

26. Isoperimetric Theorem Theorem For the infinite grid: Quadratic Theorem For the plane:

27. Isoperimetric Theorem Theorem For the infinite grid: Quadratic Idea: Plane area is comparable to grid area, and plane perimeter is comparable to grid perimeter.

28. More Examples

29. Three Dimensions In the cubical grid: # of vertices  volume # boundary edges  surface area

30. Three Dimensions In the cubical grid: # of vertices  volume # boundary edges  surface area

31. Three Dimensions In the cubical grid: # of vertices  volume # boundary edges  surface area

32. Three Dimensions In the cubical grid: # of vertices  volume # boundary edges  surface area    

33. Infinite Tree

37. Isoperimetric Inequality:

38. More Geometry Distance in a graph  length of shortest path

39. More Geometry A shortest path is called a geodesic.

40. More Geometry With distance, you can make: straight lines (geodesics) polygons balls (center point, radius  ) The geometry looks very strange on small scales, but is interesting on large scales.

41. Things to Do Volumes of Balls Random Walks Heat Diffusion Flow of Water Jumping Rabbits

42. My Favorite Graphs

44. Very similar to the hyperbolic plane!

45. The Hyperbolic Plane The hyperbolic plane is the setting for non-Euclidean geometry.    (half-plane model)

46. The Hyperbolic Plane Distances are much longer near the  -axis.    (half-plane model)

47. The Hyperbolic Plane Distances are much longer near the  -axis.   Euclidean Length Hyperbolic Length

48. The Hyperbolic Plane  not shortest distance

49. The Hyperbolic Plane Hyperbolic “lines” are semicircles.  shortest distance

50. The Hyperbolic Plane Hyperbolic “lines” are semicircles. 

51. The Hyperbolic Plane The hyperbolic plane is non-Euclidean. 

52. The Hyperbolic Plane The hyperbolic plane is non-Euclidean.    

53. My Favorite Graphs This graph is like a grid for the hyperbolic plane.

54. My Favorite Graphs This graph is like a grid for the hyperbolic plane.

55. My Favorite Graphs This graph is like a grid for the hyperbolic plane.

56. My Favorite Graphs This graph is like a grid for the hyperbolic plane.

57. My Favorite Graphs Isoperimetric Inequality:

58. Three Dimensions

59. There are only three two-dimensional geometries: Spherical geometry Euclidean geometry Hyperbolic geometry In three dimensions, there are eight geometries.

60. These were discovered by Bill Thurston in the 1970’s They are known as the Thurston geometries. 1982 Fields Medalist William Thurston Three Dimensions

61. In three dimensions, there are eight geometries. These were discovered by Bill Thurston in the 1970’s They are known as the Thurston geometries. Three Dimensions Thurston Geometrization Conjecture: Any 3-manifold can be broken into pieces, each of which has one of the eight geometries.

62. In three dimensions, there are eight geometries. This was proven by Grigori Perelman in 2006. Three Dimensions Thurston Geometrization Conjecture: Any 3-manifold can be broken into pieces, each of which has one of the eight geometries.

63. In three dimensions, there are eight geometries. Many of the Thurston geometries can be modeled effectively with graphs. Three Dimensions

64. Euclidean Three-Space

65. Hyperbolic Three-Space

66. Solv Geometry

67. PSL(2) Geometry

69. Heisenberg Geometry