Isoperimetric Dimension of Graphs
The isoperimetric dimension of graphs can be defined in a similar fashion. A precise definition is given in Chung's survey. Area and volume are measured by set sizes. For every subset A of the graph G one defines as the set of vertices in with a neighbor in A. A d-dimensional isoperimetric inequality is now defined by
(This MathOverflow question provides more details.) The graph analogs of all the examples above hold. The isoperimetric dimension of any finite graph is 0. The isoperimetric dimension of a d-dimensional grid is d. In general, the isoperimetric dimension is preserved by quasi isometries, both by quasi-isometries between manifolds, between graphs, and even by quasi isometries carrying manifolds to graphs, with the respective definitions. In rough terms, this means that a graph "mimicking" a given manifold (as the grid mimics the Euclidean space) would have the same isoperimetric dimension as the manifold. An infinite complete binary tree has isoperimetric dimension ∞.
Read more about this topic: Isoperimetric Dimension
Famous quotes containing the word dimension:
“By intervening in the Vietnamese struggle the United States was attempting to fit its global strategies into a world of hillocks and hamlets, to reduce its majestic concerns for the containment of communism and the security of the Free World to a dimension where governments rose and fell as a result of arguments between two colonels’ wives.”
—Frances Fitzgerald (b. 1940)