Search Results
Scaling limit of ballistic self-avoiding walk interacting with spatial random permutations
We consider nearest neighbour spatial random permutations on Zd. In this case, the energy of the system is proportional to the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually self-avoiding loops. The constant of proportionality, α, is the order parameter of the model. Our first result is that in a parameter regime of edge weights where it is known that a single self-avoiding loop is weakly space filling, long cycles of spatial random permutations are still exponentially unlikely. For our second result, we embed a self-avoiding walk into a background of spatial random permutations, and condition it to cover a macroscopic distance. For large values of α (where long cycles are very unlikely) we show that this walk collapses to a straight line in the scaling limit, and give bounds on the fluctuations that are almost sufficient for diffusive scaling. For proving our results, we develop the concepts of spatial strong Markov property and iterative sampling for spatial random permutations, which may be of independent interest. Among other things, we use them to show exponential decay of correlations for large values of α in great generality.
Uniformly positive correlations in the dimer model and phase transition in lattice permutations in $mathbbZ^d, d > 2$, via reflection positivity
Our first main result is that correlations between monomers in the dimer model in ℤd do not decay to zero when d > 2. This is the first rigorous result about correlations in the dimer model in dimensions greater than two and shows that the model behaves drastically differently than in two dimensions, in which case it is integrable and correlations are known to decay to zero polynomially. Such a result is implied by our more general, second main result, which states the occurrence of a phase transition in the model of lattice permutations, which is related to the quantum Bose gas. More precisely, we consider a self-avoiding walk interacting with lattice permutations and we prove that, in the regime of fully-packed loops, such a walk is `long' and the distance between its end-points grows linearly with the diameter of the box. These results follow from the derivation of a version of the infrared bound from a new general probabilistic settings, with coloured loops and walks interacting at sites and walks entering into the system from some `virtual' vertices.