REVIEW 2 cited by
Multiple SLE type scaling limits: from local to global
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Multiple SLE type scaling limits: from local to global
abstract
We consider collections of $N$ chordal random curves obtained from a critical lattice model on a planar graph, in the limit when a fine-mesh graph approximates a simply-connected domain. We define and study candidates for such limits in terms of conformally invariant collections of random curves, generated via iterated Loewner equations. These curves are a natural ``domain Markov extension'' of the earlier introduced local multiple SLE initial segments to global multiple SLE curves. For realizing them as scaling limits, we provide two a priori results to guarantee the precompactness of the discrete random curves and to allow promoting a discrete domain Markov property to the scaling limit. These results essentially only take as input certain crossing conditions, very similar to those introduced by Kemppainen and Smirnov, and they allow the identification of scaling limits via the martingale strategy of classical SLE convergence proofs. The use of these results is exemplified with convergence proofs in various lattice models.
Forward citations
Cited by 2 Pith papers
-
Tripod in uniform spanning tree and three-sided radial SLE$_2$
In the scaling limit, the wired-UST tripod on a hexagonal lattice has an explicit trifurcation density and, conditional on the trifurcation, converges to three-sided radial SLE_2.
-
Level lines of the Gaussian free field and $c=1$ degenerate conformal blocks
GFF level line crossing probabilities equal c=1 degenerate conformal blocks or fused SLE_4 partition functions, with scaling limit convergence proven for metric graph GFF under monotonicity constraints.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.