We continue our study of the chemical (graph) distance inside large critical percolation clusters in dimension two. We prove new estimates, which involve the three-arm probability, for the point-to-surface and point-to-point distances. We show that the point-to-point distance in Z 2 between two points in the same critical percolation cluster has infinite second moment. We also give quantitative versions of our previous results comparing the length of the shortest crossing to that of the lowest crossing of a box.

We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the non-Hermitian matrix around any fixed index are interlaced with those of the anti-symmetric matrix. Along the way, we show that some tools recently developed to study the eigenvalue distributions of Hermitian matrices extend to the anti-symmetric setting.

We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the non-Hermitian matrix around any fixed index are interlaced with those of the anti-symmetric matrix. Along the way, we show that some tools recently developed to study the eigenvalue distributions of Hermitian matrices extend to the anti-symmetric setting.

We consider two-dimensional critical bond percolation. Conditioned on the existence of an open circuit in an annulus, we show that the ratio of the expected size of the shortest open circuit to the expected size of the innermost circuit tends to zero as the side length of the annulus tends to infinity, the aspect ratio remaining fixed. The same proof yields a similar result for the lowest open crossing of a rectangle. In this last case, we answer a question of Kesten and Zhang by showing in addition that the ratio of the length of the shortest crossing to the length of the lowest tends to zero in probability. This suggests that the chemical distance in critical percolation is given by an exponent strictly smaller than that of the lowest path.

Although random cell complexes occur throughout the physical sciences, there does not appear to be a standard way to quantify their statistical similarities and differences. The various proposals in the literature are usually motivated by the analysis of particular physical systems and do not necessarily apply to general situations. The central concepts in this paper—the swatch and the cloth—provide a description of the local topology of a cell complex that is general (any physical system that can be represented as a cell complex is admissible) and complete (any statistical question about the local topology can be answered from the cloth). Furthermore, this approach allows a distance to be defined that measures the similarity of the local topology of two cell complexes. The distance is used to identify a steady state of a model grain boundary network, quantify the approach to this steady state, and show that the steady state is independent of the initial conditions. The same distance is then employed to show that the long-term properties in simulations of a specific model of a dislocation network do not depend on the implementation of dislocation intersections.