Isoperimetric dimension

We say about a differentiable manifold M that it satisfies a d-dimensional isoperimetric inequality if for any open set D in M with a smooth boundary one has

${\displaystyle \operatorname {area} (\partial D)\geq C\operatorname {vol} (D)^{(d-1)/d}.}$

The notations vol and area refer to the regular notions of volume and surface area on the manifold, or more precisely, if the manifold has n topological dimensions then vol refers to n-dimensional volume and area refers to (n − 1)-dimensional volume. C here refers to some constant, which does not depend on D (it may depend on the manifold and on d).

The isoperimetric dimension of M is the supremum of all values of d such that M satisfies a d-dimensional isoperimetric inequality.

A d-dimensional Euclidean space has isoperimetric dimension d. This is the well known isoperimetric problem — as discussed above, for the Euclidean space the constant C is known precisely since the minimum is achieved for the ball.

An infinite cylinder (i.e. a product of the circle and the line) has topological dimension 2 but isoperimetric dimension 1. Indeed, multiplying any manifold with a compact manifold does not change the isoperimetric dimension (it only changes the value of the constant C). Any compact manifold has isoperimetric dimension 0.

It is also possible for the isoperimetric dimension to be larger than the topological dimension. The simplest example is the infinite jungle gym, which has topological dimension 2 and isoperimetric dimension 3. See for pictures and Mathematica code.

The hyperbolic plane has topological dimension 2 and isoperimetric dimension infinity. In fact the hyperbolic plane has positive Cheeger constant. This means that it satisfies the inequality

${\displaystyle \operatorname {area} (\partial D)\geq C\operatorname {vol} (D),}$

which obviously implies infinite isoperimetric dimension.

The isoperimetric dimension of graphs can be defined in a similar fashion. A precise definition is given in Chung's survey.[1] Area and volume are measured by set sizes. For every subset A of the graph G one defines ${\displaystyle \partial A}$ as the set of vertices in ${\displaystyle G\setminus A}$ with a neighbor in A. A d-dimensional isoperimetric inequality is now defined by

${\displaystyle |\partial A|\geq C\left(\min \left(|A|,|G\setminus A|\right)\right)^{(d-1)/d}.}$

(This MathOverflow question provides more details.) The graph analogs of all the examples above hold but the definition is slightly different in order to avoid that the isoperimetric dimension of any finite graph is 0: In the above formula the volume of ${\displaystyle A}$ is replaced by ${\displaystyle \min(|A|,|G\setminus A|)}$ (see Chung's survey, section 7).

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 ∞.

A simple integration over r (or sum in the case of graphs) shows that a d-dimensional isoperimetric inequality implies a d-dimensional volume growth, namely

${\displaystyle \operatorname {vol} B(x,r)\geq Cr^{d}}$

where B(x,r) denotes the ball of radius r around the point x in the Riemannian distance or in the graph distance. In general, the opposite is not true, i.e. even uniformly exponential volume growth does not imply any kind of isoperimetric inequality. A simple example can be had by taking the graph Z (i.e. all the integers with edges between n and n + 1) and connecting to the vertex n a complete binary tree of height |n|. Both properties (exponential growth and 0 isoperimetric dimension) are easy to verify.

An interesting exception is the case of groups. It turns out that a group with polynomial growth of order d has isoperimetric dimension d. This holds both for the case of Lie groups and for the Cayley graph of a finitely generated group.

A theorem of Varopoulos connects the isoperimetric dimension of a graph to the rate of escape of random walk on the graph. The result states

Varopoulos' theorem: If G is a graph satisfying a d-dimensional isoperimetric inequality then

${\displaystyle p_{n}(x,y)\leq Cn^{-d/2}}$

where ${\textstyle p_{n}(x,y)}$ is the probability that a random walk on G starting from x will be in y after n steps, and C is some constant.

• Isaac Chavel, Isoperimetric Inequalities: Differential geometric and analytic persepectives, Cambridge university press, Cambridge, UK (2001), ISBN 0-521-80267-9

Discusses the topic in the context of manifolds, no mention of graphs.

• N. Th. Varopoulos, Isoperimetric inequalities and Markov chains, J. Funct. Anal. 63:2 (1985), 215–239.
• Thierry Coulhon and Laurent Saloff-Coste, Isopérimétrie pour les groupes et les variétés, Rev. Mat. Iberoamericana 9:2 (1993), 293–314.

This paper contains the result that on groups of polynomial growth, volume growth and isoperimetric inequalities are equivalent. In French.

• Fan Chung, Discrete Isoperimetric Inequalities. Surveys in Differential Geometry IX, International Press, (2004), 53–82. http://math.ucsd.edu/~fan/wp/iso.pdf.

This paper contains a precise definition of the isoperimetric dimension of a graph, and establishes many of its properties.