Search arXivSearch

arXiv subjects

Alex Karrila

Publications and source records attributed to Alex Karrila.

16 recordsLinked to original sources

Level lines of the Gaussian free field and $c=1$ degenerate conformal blocks

We consider Gaussian free field (GFF) on simply connected domains with piecewise constant Dirichlet boundary data. We show that the crossing probabilities for its level lines are determined by conformal blocks of primary fields in a conformal field theory (CFT) with central charge $c = 1$ which are degenerate at each insertion. Alternatively, the crossing probabilities are ratios of explicit partition functions of fused multiple $\mathrm{SLE}_4$ curves, which can be written in terms of fused Specht polynomials introduced recently by Lafay, Peltola, & Roussillon in a representation-theoretic context. We also prove that for the metric graph GFF introduced by Lupu, with appropriate boundary conditions, the crossing probabilities for its level sets converge in the scaling limit to our formulas. In particular, the geometry of the level-set percolation for both the continuum GFF and the metric graph GFF has a CFT description in terms of the aforementioned $c=1$ conformal blocks, which are linearly independent and solve the Belavin-Polyakov-Zamolodchikov (BPZ) PDEs of arbitrary orders. Interestingly, not all combinatorial boundary conditions are amenable for the GFF models -- while the CFT contains conformal blocks of primary fields labeled by generalized Dyck paths (i.e., semi-standard Young tableaux), the ones appearing in the above models satisfy specific monotonicity constraints.

math-ph

Smoothness of martingale observables and generalized Feynman-Kac formulas

We prove that, under the H\"ormander criterion on an It\^{o} process, all its martingale observables are smooth. As a consequence, we also obtain a generalized Feynman-Kac formula providing smooth solutions to certain PDE boundary-value problems, while allowing for degenerate diffusions as well as boundary stopping (under very mild boundary regularity assumptions). We also highlight an application to a question posed on Schramm-Loewner evolutions, by making certain Girsanov transform martingales accessible via It\^{o} calculus.

math.PR

Operator product expansions of derivative fields in the sine-Gordon model

In this article, we initiate the study of operator product expansions (OPEs) for the sine-Gordon model. For simplicity, we focus on the model below the first threshold of collapse ($\beta<4\pi$) and on the singular terms in OPEs of derivative-type fields $\partial \varphi$ and $\bar\partial\varphi$. We prove that compared to corresponding free field OPEs, the sine-Gordon OPEs develop logarithmic singularities and generate Wick ordered exponentials. Our approach for proving the OPEs relies heavily on Onsager-type inequalities and associated moment bounds for GFF correlation functions involving Wick ordered exponentials of the free field.

math-ph

Planar UST Branches and $c=-2$ Degenerate Boundary Correlations

We provide a conformal field theory (CFT) description of the probabilistic model of boundary effects in the wired uniform spanning tree (UST) and its algebraic content, concerning the entire first row of the Kac table with central charge $c=-2$. Namely, we prove that all boundary-to-boundary connection probabilities for (potentially fused) branches in the wired UST converge in the scaling limit to explicit CFT quantities, expressed in terms of determinants, which can also be viewed as conformal blocks of degenerate primary fields in a boundary CFT with central charge $c=-2$. Moreover, we verify that the Belavin-Polyakov-Zamolodchikov (BPZ) PDEs (i.e., Virasoro degeneracies) of arbitrary orders hold, and we also reveal an underlying valenced Temperley-Lieb algebra action on the space of boundary correlation functions of primary fields in this model. To prove these results, we combine probabilistic techniques with representation theory.

math-ph

A new computation of pairing probabilities in several multiple-curve models

We give a new, short computation of pairing probabilities for multiple chordal interfaces in the critical Ising model, the harmonic explorer, and for multiple level lines of the Gaussian free field. The core of the argument are the known convexity property and a new uniqueness property of local multiple SLE$(\kappa)$ measures, valid for all $\kappa > 0$. In particular, the proof is directly is applicable for any underlying random curve model, once it is identified as a local multiple SLE$(\kappa)$ both conditionally and unconditionally on the pairing topology.

math.PR

Delocalization of the height function of the six-vertex model

We show that the height function of the six-vertex model, in the parameter range $\mathbf a=\mathbf b=1$ and $\mathbf c\ge1$, is delocalized with logarithmic variance when $\mathbf c\le 2$. This complements the earlier proven localization for $\mathbf c>2$. Our proof relies on Russo--Seymour--Welsh type arguments, and on the local behaviour of the free energy of the cylindrical six-vertex model, as a function of the unbalance between the number of up and down arrows.

math.PR

UST branches, martingales, and multiple SLE(2)

We identify the local scaling limit of multiple boundary-to-boundary branches in a uniform spanning tree (UST) as a local multiple SLE(2), i.e., an SLE(2) process weighted by a suitable partition function. By recent results, this also characterizes the "global" scaling limit of the full collection of full curves. The identification is based on a martingale observable in the UST with $N$ branches, obtained by weighting the well-known martingale in the UST with one branch by the discrete partition functions of the models. The obtained weighting transforms of the discrete martingales and the limiting SLE processes, respectively, only rely on a discrete domain Markov property and (essentially) the convergence of partition functions. We illustrate their generalizability by sketching an analogous convergence proof for a boundary-visiting UST branch and a boundary-visiting SLE(2).

math.PR

Multiple SLE type scaling limits: from local to global

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.

math-ph

Conformal blocks, $q$-combinatorics, and quantum group symmetry

In this article, we find a $q$-analogue for Fomin's formulas. The original Fomin's formulas relate determinants of random walk excursion kernels to loop-erased random walk partition functions, and our formulas analogously relate conformal block functions of conformal field theories to pure partition functions of multiple SLE random curves. We also provide a construction of the conformal block functions by a method based on a quantum group, the $q$-deformation of $\mathfrak{sl}_2$. The construction both highlights the representation theoretic origin of conformal block functions and explains the appearance of $q$-combinatorial formulas.

math-ph

Boundary correlations in planar LERW and UST

We find explicit formulas for the probabilities of general boundary visit events for planar loop-erased random walks, as well as connectivity events for branches in the uniform spanning tree. We show that both probabilities, when suitably renormalized, converge in the scaling limit to conformally covariant functions which satisfy partial differential equations of second and third order, as predicted by conformal field theory. The scaling limit connectivity probabilities also provide formulas for the pure partition functions of multiple $\mathrm{SLE}_\kappa$ at $\kappa=2$.

math-ph

Lattice coding for Rician fading channels from Hadamard rotations

In this paper, we study lattice coding for Rician fading wireless channels. This is motivated in particular by preliminary studies suggesting the Rician fading model for millimeter-wavelength wireless communications. We restrict to lattice codes arising from rotations of $\mathbb{Z}^n$, and to a single-input single-output (SISO) channel. We observe that several lattice design criteria suggest the optimality of Hadamard rotations. For instance, we prove that Hadamard rotations maximize the diamond-packing density among all rotated $\mathbb{Z}^n$ lattices. Finally, we provide simulations to show that Hadamard rotations outperform optimal algebraic rotations and cross-packing lattices in the Rician channel.

cs.IT

Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels

The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From these bounds, it is explicit that both the information leakage and error probability are controlled by the average flatness factor of the eavesdropper's lattice, which we further interpret geometrically. It is concluded that the minimization of the (average) flatness factor of the eavesdropper's lattice leads to the study of well-rounded lattices, which are shown to be among the optimal in order to achieve these minima. Constructions of some well-rounded lattices are also provided.

cs.IT

Well-Rounded Lattices for Coset Coding in MIMO Wiretap Channels

The concept of well-rounded lattices has recently found important applications in the setting of a fading single-input single-output (SISO) wiretap channel. It has been shown that, under this setup, the property of being well-rounded is critical for minimizing the eavesdropper's probability of correct decoding in lower SNR regimes. The superior performance of coset codes constructed from well-rounded lattices has been illustrated in several simulations. In the present article, this work is extended to fading multiple-input multiple-output (MIMO) wiretap channels, and similar design criteria as in the SISO case are derived. Further, explicit coset codes for Rayleigh fading MIMO wiretap channels are designed. In particular, it is shown through extensive simulations that sublattices of the well-known Alamouti code and Golden code which meet our design criteria perform better than scalar multiples of the code lattice for the same parameters.

cs.IT

Information Bounds and Flatness Factor Approximation for Fading Wiretap MIMO Channels

In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which it is explicitly seen that both quantities are upper bounded by (increasing functions of) the expected flatness factor of the faded lattice related to the eavesdropper. By making use of a recently developed approximation of the theta series of a lattice, it is further shown how the average flatness factor can be approximated numerically. In particular, based on the numerical computations, the average flatness factor not only bounds but also orders correctly the performance of different lattices.

cs.IT

Well-Rounded Lattices for Reliability and Security in Rayleigh Fading SISO Channels

For many wiretap channel models asymptotically optimal coding schemes are known, but less effort has been put into actual realizations of wiretap codes for practical parameters. Bounds on the mutual information and error probability when using coset coding on a Rayleigh fading channel were recently established by Oggier and Belfiore, and the results in this paper build on their work. However, instead of using their ultimate inverse norm sum approximation, a more precise expression for the eavesdropper's probability of correct decision is used in order to determine a general class of good coset codes. The code constructions are based on well-rounded lattices arising from simple geometric criteria. In addition to new coset codes and simulation results, novel number-theoretic results on well-rounded ideal lattices are presented.

cs.IT

A Comparison of Skewed and Orthogonal Lattices in Gaussian Wiretap Channels

We consider lattice coset-coded transmissions over a wiretap channel with additive white Gaussian noise (AWGN). Examining a function that can be interpreted as either the legitimate receiver's error probability or the eavesdropper's correct decision probability, we rigorously show that, albeit offering simple bit labeling, orthogonal nested lattices are suboptimal for coset coding in terms of both the legitimate receiver's and the eavesdropper's probabilities.

cs.IT