arXiv subjects

Jacopo Borga

Publications and source records attributed to Jacopo Borga.

At least 19 recordsLinked to original sources

arXiv2025

Directed distances in bipolar-oriented triangulations: exact exponents and scaling limits

We study longest and shortest directed paths in the following natural model of directed random planar maps: the uniform infinite bipolar-oriented triangulation (UIBOT), which is the local limit of uniform bipolar-oriented triangulations around a typical edge. We construct the Busemann function which measures directed distance to $\infty$ along a natural interface in the UIBOT. We show that in the case of longest (resp.\ shortest) directed paths, this Busemann function converges in the scaling limit to a $2/3$-stable L\'evy process (resp.\ a $4/3$-stable L\'evy process). We also prove up-to-constants bounds for directed distances in finite bipolar-oriented triangulations sampled from a Boltzmann distribution, and for size-$n$ cells in the UIBOT. These bounds imply that in a typical subset of the UIBOT with $n$ edges, longest directed path lengths are of order $n^{3/4}$ and shortest directed path lengths are of order $n^{3/8}$. These results give the scaling dimensions for discretizations of the (hypothetical) $\sqrt{4/3}$-directed Liouville quantum gravity metrics. The main external input in our proof is the bijection of Kenyon-Miller-Sheffield-Wilson (2015). We do not use any continuum theory. We expect that our techniques can also be applied to prove similar results for directed distances in other random planar map models and for longest increasing subsequences in pattern-avoiding permutations.

math.PR↗

arXiv2025

Permuton and local limits for the Luce model

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities proportional to prescribed positive weights. These permutations arise in applications such as ranking models, the Tsetlin library, and related Markov processes. Under minimal assumptions on the weights, we establish a permuton limit theorem describing the global behavior of Luce-distributed permutations and derive an explicit density of the limiting permuton. We further compute limiting pattern densities and analyze the differences between exact Luce permutations and their permuton approximations. We also study the local convergence of these permutations, proving a quenched Benjamini--Schramm limit and a central limit theorem for consecutive pattern occurrences. Finally, we prove a central limit theorem for the number of inversions.

math.PR↗

arXiv2025

Surface sums in two-dimensional large-$N$ lattice Yang--Mills: Cancellations and explicit computations for general loops

In the context of two-dimensional large-$N$ lattice Yang--Mills theory, we perform a refined study of the surface sums defined in the companion work [BCSK24]. In this setting, the surface sums are a priori expected to exhibit significant simplifications because two-dimensional Yang--Mills theory is a special model that admits many known exact formulas. Thus, a natural problem is to understand these simplifications directly from the perspective of the surface sums. Towards this goal, we develop a key new tool in the form of a surface exploration algorithm (or "peeling process"), which, at each step, carefully selects the next edge to explore. Using this algorithm, we manage to find many cancellations in the surface sums, thereby obtaining a detailed understanding of precisely which surfaces remain after cancellation. As a consequence, we obtain many new explicit formulas for Wilson loop expectations of general loops in the large-$N$ limit of lattice Yang--Mills in two dimensions and prove a convergence result for the empirical spectral measure of any simple loop.

math.PR↗

arXiv2025

The longest increasing subsequence of Brownian separable permutons

We establish a scaling limit result for the length $\operatorname{LIS}(\sigma_n)$ of the longest increasing subsequence of a permutation $\sigma_n$ of size $n$ sampled from the Brownian separable permuton $\boldsymbol{\mu}_p$ of parameter $p\in(0,1)$, which is the universal limit of pattern-avoiding permutations. Specifically, we prove that \[\frac{\operatorname{LIS}(\sigma_n)}{n^\alpha}\;\underset{n\to\infty}{\overset{\mathrm{a.s.}}{\longrightarrow}}\; X,\] where $\alpha=\alpha(p)$ is the unique solution in the interval $(1/2,1)$ to the equation \[\frac{1}{4^{\frac{1}{2\alpha}}\sqrt{\pi}}\,\frac{\Gamma\big(\tfrac{1}{2}-\tfrac{1}{2\alpha}\big)}{\Gamma\big(1-\tfrac{1}{2\alpha}\big)}=\frac{p}{p-1},\] and $X=X(p)$ is a non-deterministic and a.s. positive and finite random variable, which is a measurable function of the Brownian separable permuton. Notably, the exponent $\alpha(p)$ is an increasing continuous function of $p$ with $\alpha(0^+)=1/2$, $\alpha(1^-)=1$ and $\alpha(1/2)\approx0.815226$, which corresponds to the permuton limit of uniform separable permutations. We prove analogous results for the size of the largest clique of a graph sampled from the Brownian cographon of parameter $p\in(0,1)$.

math.PR↗

arXiv2024

High-dimensional permutons: theory and applications

Permutons, which are probability measures on the unit square $[0, 1]^2$ with uniform marginals, are the natural scaling limits for sequences of (random) permutations. We introduce a $d$-dimensional generalization of these measures for all $d \ge 2$, which we call $d$-dimensional permutons, and extend -- from the two-dimensional setting -- the theory to prove convergence of sequences of (random) $d$-dimensional permutations to (random) $d$-dimensional permutons. Building on this new theory, we determine the random high-dimensional permuton limits for two natural families of high-dimensional permutations. First, we determine the $3$-dimensional permuton limit for Schnyder wood permutations, which bijectively encode planar triangulations decorated by triples of spanning trees known as Schnyder woods. Second, we identify the $d$-dimensional permuton limit for $d$-separable permutations, a pattern-avoiding class of $d$-dimensional permutations generalizing ordinary separable permutations. Both high-dimensional permuton limits are random and connected to previously studied universal 2-dimensional permutons, such as the Brownian separable permutons and the skew Brownian permutons, and share interesting connections with objects arising from random geometry, including the continuum random tree, Schramm--Loewner evolutions, and Liouville quantum gravity surfaces.

math.PR↗

arXiv2024

Surface sums for lattice Yang-Mills in the large-$N$ limit

We give a sum over weighted planar surfaces formula for Wilson loop expectations in the large-$N$ limit of strongly coupled lattice Yang-Mills theory, in any dimension. The weights of each surface are simple and expressed in terms of products of signed Catalan numbers. In establishing our results, the main novelty is to convert a recursive relation for Wilson loop expectations, known as the master loop equation, into a new peeling exploration of the planar surfaces. This exploration reveals hidden cancellations within the sums, enabling a deeper understanding of the structure of the planar surfaces. We view our results as a continuation of the program initiated in [CPS23] to understand Yang-Mills theories via surfaces and as a refinement of the string trajectories point-of-view developed in [Cha19a].

math.PR↗

arXiv2024

Reconstructing SLE-decorated Liouville quantum gravity surfaces from random permutons

Permutons constructed from a Liouville quantum gravity surface and a pair of space-filling Schramm-Loewner evolutions (SLEs) have been shown -- or are conjectured -- to describe the scaling limit of various natural models of random constrained permutations. We prove that, in two distinct and natural settings, these permutons uniquely determine, modulo rotation, scaling, translation and reflection, both the Liouville quantum gravity surface and the pair of space-filling SLEs used in their construction. In other words, the Liouville quantum gravity surface and the pair of space-filling SLEs can be deterministically reconstructed from the permuton. Our results cover the cases of the skew Brownian permutons, the universal limits of pattern-avoiding permutations, and the meandric permuton, which is the conjectural permuton limit of permutations obtained from uniform meanders. In the course of the proof, we give a detailed description of how the support of the permuton relates to the multiple points of the two space-filling SLEs.

math.PR↗

arXiv2023

A determinantal point process approach to scaling and local limits of random Young tableaux

We obtain scaling and local limit results for large random Young tableaux of fixed shape $\lambda^0$ via the asymptotic analysis of a determinantal point process due to Gorin and Rahman (2019). More precisely, we prove: (1) an explicit description of the limiting surface of a uniform random Young tableau of shape $\lambda^0$, based on solving a complex-valued polynomial equation; (2) a simple criteria to determine if the limiting surface is continuous in the whole domain; (3) and a local limit result in the bulk of a random Poissonized Young tableau of shape $\lambda^0$. Our results have several consequences, for instance: they lead to explicit formulas for the limiting surface of $L$-shaped tableaux, generalizing the results of Pittel and Romik (2007) for rectangular shapes; they imply that the limiting surface for $L$-shaped tableaux is discontinuous for almost-every $L$-shape; and they give a new one-parameter family of infinite random Young tableaux, constructed from the so-called random infinite bead process.

math.PR↗

arXiv2023

Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons

The Brownian separable permutons are a one-parameter family -- indexed by $p\in(0,1)$ -- of universal limits of random constrained permutations. We show that for each $p\in (0,1)$, there are explicit constants $1/2 < \alpha_*(p) \leq \beta^*(p) < 1$ such that the length of the longest increasing subsequence in a random permutation of size $n$ sampled from the Brownian separable permuton is between $n^{\alpha_*(p) - o(1)}$ and $n^{\beta^*(p) + o(1)}$ with probability tending to 1 as $n\to\infty$. In the symmetric case $p=1/2$, we have $\alpha_*(p) \approx 0.812$ and $\beta^*(p)\approx 0.975$. We present numerical simulations which suggest that the lower bound $\alpha_*(p)$ is close to optimal in the whole range $p\in(0,1)$. Our results work equally well for the closely related Brownian cographons. In this setting, we show that for each $p\in (0,1)$, the size of the largest clique (resp. independent set) in a random graph on $n$ vertices sampled from the Brownian cographon is between $n^{\alpha_*(p) - o(1)}$ and $n^{\beta^*(p) + o(1)}$ (resp. $n^{\alpha_*(1-p) - o(1)}$ and $n^{\beta^*(1-p) + o(1)}$) with probability tending to 1 as $n\to\infty$. Our proofs are based on the analysis of a fragmentation process embedded in a Brownian excursion introduced by Bertoin (2002). We expect that our techniques can be extended to prove similar bounds for uniform separable permutations and uniform cographs.

math.PR↗

arXiv2022

On the geometry of uniform meandric systems

A meandric system of size $n$ is the set of loops formed from two arc diagrams (non-crossing perfect matchings) on $\{1,\dots,2n\}$, one drawn above the real line and the other below the real line. A uniform random meandric system can be viewed as a random planar map decorated by a Hamiltonian path (corresponding to the real line) and a collection of loops (formed by the arcs). Based on physics heuristics and numerical evidence, we conjecture that the scaling limit of this decorated random planar map is given by an independent triple consisting of a Liouville quantum gravity (LQG) sphere with parameter $\gamma=\sqrt 2$, a Schramm-Loewner evolution (SLE) curve with parameter $\kappa=8$, and a conformal loop ensemble (CLE) with parameter $\kappa=6$. We prove several rigorous results which are consistent with this conjecture. In particular, a uniform meandric system admits loops of nearly macroscopic graph-distance diameter with high probability. Furthermore, a.s., the uniform infinite meandric system with boundary has no infinite path. But, a.s., its boundary-modified version has a unique infinite path whose scaling limit is conjectured to be chordal SLE$_6$.

math.PR↗

arXiv2022

Permutons, meanders, and SLE-decorated Liouville quantum gravity

We study a class of random permutons which can be constructed from a pair of space-filling Schramm-Loewner evolution (SLE) curves on a Liouville quantum gravity (LQG) surface. This class includes the skew Brownian permutons introduced by Borga (2021), which describe the scaling limit of various types of random pattern-avoiding permutations. Another interesting permuton in our class is the meandric permuton, which corresponds to two independent SLE$_8$ curves on a $\gamma$-LQG surface with $\gamma = \sqrt{\frac13 \left( 17 - \sqrt{145} \right)}$. Building on work by Di Francesco, Golinelli, and Guitter (2000), we conjecture that the meandric permuton describes the scaling limit of uniform meandric permutations, i.e., the permutations induced by a simple loop in the plane which crosses a line a specified number of times. We show that for any sequence of random permutations which converges to one of the above random permutons, the length of the longest increasing subsequence is sublinear. This proves that the length of the longest increasing subsequence is sublinear for Baxter, strong-Baxter, and semi-Baxter permutations and leads to the conjecture that the same is true for meandric permutations. We also prove that the closed support of each of the random permutons in our class has Hausdorff dimension one. Finally, we prove a re-rooting invariance property for the meandric permuton and write down a formula for its expected pattern densities in terms of LQG correlation functions (which are known explicitly) and the probability that an SLE$_8$ hits a given set of points in numerical order (which is not known explicitly). We conclude with a list of open problems.

math.PR↗

arXiv2022

Large deviation principle for random permutations

We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of models of random permutations, called Gibbs permutation models, which combines and generalizes $\mu$-random permutations and the celebrated Mallows model for permutations. Most of our results hold in the general setting of Gibbs permutation models. We apply the tools that we develop to the case of $\mu$-random permutations conditioned to have an atypical proportion of patterns. Several results are made more concrete in the specific case of inversions. For instance, we prove the existence of at least one phase transition for a generalized version of the Mallows model where the base measure is non-uniform. This is in contrast with the results of Starr (2009, 2018) on the (standard) Mallows model, where the absence of phase transition, i.e., phase uniqueness, was proven. Our results naturally lead us to investigate a new notion of permutons, called conditionally constant permutons, which generalizes both pattern-avoiding and pattern-packing permutons. We describe some properties of conditionally constant permutons with respect to inversions. The study of conditionally constant permutons for general patterns seems to be a challenging problem.

math.PR↗

arXiv2022

Baxter permuton and Liouville quantum gravity

The Baxter permuton is a random probability measure on the unit square which describes the scaling limit of uniform Baxter permutations. We find an explict formula for the expectation of the Baxter permuton, i.e.\ the density of its intensity measure. This answers a question of Dokos and Pak (2014). We also prove that all pattern densities of the Baxter permuton are strictly positive, distinguishing it from other permutons arising as scaling limits of pattern-avoiding permutations. Our proofs rely on a recent connection between the Baxter permuton and Liouville quantum gravity (LQG) coupled with the Schramm-Loewner evolution (SLE). The method works equally well for a two-parameter generalization of the Baxter permuton recently introduced by the first author, except that the density is not as explicit. This new family of permutons, called \emph{skew Brownian permuton}, describes the scaling limit of a number of random constrained permutations. We finally observe that in the LQG/SLE framework, the expected proportion of inversions in a skew Brownian permuton equals $\frac{\pi-2\theta}{2\pi}$ where $\theta$ is the so-called imaginary geometry angle between a certain pair of SLE curves.

math.PR↗

arXiv2021

The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton

We recently introduced a new universal family of permutons, depending on two parameters, called skew Brownian permuton. For some specific choices of the parameters, the skew Brownian permuton coincides with some previously studied permutons: the biased Brownian separable permuton and the Baxter permuton. The latter two permutons are degenerate cases of the skew Brownian permuton. In the present paper we prove the first convergence result towards a non-degenerate skew Brownian permuton. Specifically, we prove that strong-Baxter permutations converge in the permuton sense to the skew Brownian permuton for a non-degenerate choice of the two parameters. In order to do that, we develop a robust technique to prove convergence towards the skew Brownian permuton for various families of random constrained permutations. This technique relies on generating trees for permutations, allowing an encoding of permutations with multi-dimensional walks in cones. We apply this technique also to semi-Baxter permutations.

math.PR↗

arXiv2021

The skew Brownian permuton: a new universality class for random constrained permutations

We construct a new family of random permutons, called skew Brownian permuton, which describes the limits of several models of random constrained permutations. This family is parametrized by two real parameters. For a specific choice of the parameters, the skew Brownian permuton coincides with the Baxter permuton, i.e., the permuton limit of Baxter permutations. We prove that for another specific choice of the parameters, the skew Brownian permuton coincides with the biased Brownian separable permuton, a one-parameter family of permutons previously studied in the literature as the limit of uniform permutations in substitution-closed classes. This brings two different limiting objects under the same roof, identifying a new larger universality class. The skew Brownian permuton is constructed in terms of flows of solutions of certain stochastic differential equations (SDEs) driven by two-dimensional correlated Brownian excursions in the non-negative quadrant. We call these SDEs skew perturbed Tanaka equations because they are a mixture of the perturbed Tanaka equations and the equations encoding skew Brownian motions. We prove existence and uniqueness of (strong) solutions for these new SDEs. In addition, we show that some natural permutons arising from Liouville quantum gravity spheres decorated with two Schramm-Loewner evolution curves are skew Brownian permutons and such permutons cover almost the whole range of possible parameters. Some connections between constrained permutations and decorated planar maps have been investigated in the literature at the discrete level; this paper establishes this connection directly at the continuum level. Proving the latter result, we also give an SDE interpretation of some quantities related to SLE-decorated Liouville quantum gravity spheres.

math.PR↗

arXiv2021

Random Permutations -- A geometric point of view

We look at geometric limits of large random non-uniform permutations. We mainly consider two theories for limits of permutations: permuton limits, introduced by Hoppen, Kohayakawa, Moreira, Rath, and Sampaio to define a notion of scaling limits for permutations; and Benjamini-Schramm limits, introduced by the author to define a notion of local limits for permutations. The models of random permutations that we consider are mainly constrained models, that is, uniform permutations belonging to a given subset of the set of all permutations. We often identify this subset using pattern-avoidance, focusing on: permutations avoiding a pattern of length three, substitution-closed classes, (almost) square permutations, permutation families encoded by generating trees, and Baxter permutations. We explore some universal phenomena for the models mentioned above. For Benjamini-Schramm limits we explore a concentration phenomenon for the limiting objects. For permuton limits we deepen the study of some known universal permutons, called biased Brownian separable permutons, and we introduce some new ones, called Baxter permuton and skew Brownian permutons. In addition, for (almost) square permutations, we investigate the occurrence of a phase transition for the limiting permutons. On the way, we establish various combinatorial results both for permutations and other related objects. Among others, we give a complete description of the feasible region for consecutive patterns as the cycle polytope of a specific graph; and we find new bijections relating Baxter permutations, bipolar orientations, walks in cones, and a new family of discrete objects called coalescent-walk processes.

math.PR↗

arXiv2021

Quenched law of large numbers and quenched central limit theorem for multi-player leagues with ergodic strengths

We propose and study a new model for competitions, specifically sports multi-player leagues where the initial strengths of the teams are independent i.i.d. random variables that evolve during different days of the league according to independent ergodic processes. The result of each match is random: the probability that a team wins against another team is determined by a function of the strengths of the two teams in the day the match is played. Our model generalizes some previous models studied in the physical and mathematical literature and is defined in terms of different parameters that can be statistically calibrated. We prove a quenched -- conditioning on the initial strengths of the teams -- law of large numbers and a quenched central limit theorem for the number of victories of a team according to its initial strength. To obtain our results, we prove a theorem of independent interest. For a stationary process $\xi=(\xi_i)_{i\in \mathbb{N}}$ satisfying a mixing condition and an independent sequence of i.i.d. random variables $(s_i)_{i\in \mathbb{N}}$, we prove a quenched -- conditioning on $(s_i)_{i\in\mathbb{N}}$ -- central limit theorem for sums of the form $\sum_{i=1}^{n}g\left(\xi_i,s_i\right)$, where $g$ is a bounded measurable function. We highlight that the random variables $g\left(\xi_i,s_i\right)$ are not stationary conditioning on $(s_i)_{i\in\mathbb{N}}$.

math.PR↗

arXiv2021

Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one-dimensional labels

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such permutations. We propose a technique to sample uniform permutations in such families as conditioned random colored walks. Building on that, we derive the behavior of the consecutive patterns in random permutations studying properties of the consecutive increments in the corresponding random walks. The method applies to families of permutations with a one-dimensional-labeled generating tree (together with some technical assumptions) and implies local convergence for random permutations in such families. We exhibit ten different families of permutations, most of them being permutation classes, that satisfy our assumptions. To the best of our knowledge, this is the first work where generating trees - which were introduced to enumerate combinatorial objects - have been used to establish probabilistic results.

math.PR↗