The triangle and the open triangle
We show that for percolation on any transitive graph, the triangle condition implies the open triangle condition.
We show that for percolation on any transitive graph, the triangle condition implies the open triangle condition.
We study the “Fourier symmetry” of measures and distributions on the circle, in relation with the size of their supports. The main results of this paper are: (i) A one-side extension of Frostman’s theorem, which connects the rate of decay of Fourier transform of a distribution with the Hausdorff dimension of its support; (ii) A construction of compacts of “critical” size, which support distributions (even pseudo-functions) with anti-analytic part belonging to . ...
We study the entropy of the set traced by an -step simple symmetric random walk on ℤ. We show that for ≥3, the entropy is of order . For =2, the entropy is of order /log2. These values are essentially governed by the size of the boundary of the trace.
In this article, we consider the following model of self-avoiding walk: the probability of a self-avoiding trajectory between two points on the boundary of a finite subdomain of is proportional to . When is supercritical (i.e. where is the connective constant of the lattice), we show that the random trajectory becomes space-filling when taking the scaling limit.
Page 1