Strong isoperimetric inequality for the edge graph of a tiling of the plane (Q1842032): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q495960 |
||
Property / author | |||
Property / author: Andrea Calogero / rank | |||
Revision as of 08:21, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strong isoperimetric inequality for the edge graph of a tiling of the plane |
scientific article |
Statements
Strong isoperimetric inequality for the edge graph of a tiling of the plane (English)
0 references
18 April 1995
0 references
The graphs which satisfy a strong isoperimetric inequality have been intensely studied in the last few years. Taking \(\Gamma\) an infinite, connected and locally finite graph, it is possible to associate \(\Gamma\) with an irreducible Markov chain (called simple random walk on \(\Gamma\)) through a standard procedure due to \textit{C. St. J. A. Nash-Williams} [Proc. Camb. Philos. Soc. 55, 181-194 (1959; Zbl 0100.136)]. The graph \(\Gamma\) is called transient or recurrent depending on whether the associated Markov chain is transient or recurrent. It is known [\textit{P. Gerl}, J. Theor. Probab. 1, No. 2, 171-187 (1988; Zbl 0639.60072)] that a graph which satisfies a strong isoperimetric inequality is strongly transient (i.e. the spectral radius \(\sigma_ p\) of the random walk is smaller than 1). So, it is interesting to study which graphs satisfy a strong isoperimetric inequality. \textit{J. Dodziuk} [Trans. Am. Math. Soc. 284, 787-794 (1984; Zbl 0512.39001)] showed that the edge graph of a locally finite and triangular tiling of the plane, which has all vertices with degree \(d_ V\geq 7\), satisfies a strong isoperimetric inequality. By generalizing Dodziuk's result, \textit{P. M. Soardi} [Math. Ann. 287, No. 4, 613-626 (1990; Zbl 0679.60072)] has proved that the edge graph of certain types of locally finite tilings still satisfies a strong isoperimetric inequality. In this paper we continue this line of investigation. The result obtained by Soardi is relative to tilings where every tile has exactly \(k\) vertices. In our case, all tilings are shaped from two different types of tiles which satisfy a mutual adjacency condition. Although normal tilings satisfying these conditions have been known for some time (see [(*) \textit{B. Grünbaum} and \textit{G. C. Shephard}, Tilings and patterns (1987; Zbl 0601.05001)]) we were not able to find in the literature non-normal tilings of this type with positive constant \(\eta>0\). In the final section we provide a general method for the construction of the tilings treated in this paper, by showing that they arise naturally from non- normal homogeneous tilings (see (*)). The main result of the paper states that all such tilings with \(\eta>0\) have edge graphs that satisfy a strong isoperimetric inequality.
0 references
irreducible Markov chain
0 references
simple random walk
0 references
strong isoperimetric inequality
0 references
tiling of the plane
0 references
edge graph
0 references
locally finite tilings
0 references