Searcharxiv⌕ Search

arXiv subjects

Cédric Boutillier

Publications and source records attributed to Cédric Boutillier.

At least 19 recordsLinked to original sources

Limit shape of the leaky Abelian sandpile model with multiple layers

In this paper we study a triple generalization of the Leaky Abelian Sandpile Model (LASM) of Alevy and Mkrtchyan, originally analyzed in the case of the square lattice in dimension two. First, we work in any dimension. Second, each site can hold several different stacks of sand, one for each of a certain given number of different layers or colors. Third, when a stack of one color at a site topples, it can send sand not only to its nearest neighbors in equal amounts, but to all possible locations and colors, according to a fixed but arbitrary mass distribution. Stacks of different colors can topple according to different distributions and different leakiness parameters, however the toppling rule should be site-independent. We obtain three main results. First, in this generality, when the LASM is started with $N$ grains of sand in one color at the origin, the final stable configuration, after scaling down by $\log N$, converges to a limit shape as $N$ goes to infinity. Second, when the leakiness parameter converges to infinity and the toppling distribution has finite range, the limit shape converges to a polytope. Third, when the leakiness parameters converge to one, which means the leakiness disappears, the limit shape of the sandpile converges to an ellipsoid. From a technical point of view, we rely on a strong relation between the Green function for random walk and the shape of the sandpile. Finally, the limit shape exhibits interesting duality properties, which we also investigate.

math.PR↗

Fock's dimer model on the Aztec diamond

We consider the dimer model on the Aztec diamond with Fock's weights, which is gauge equivalent to the model with any choice of positive weight function. We prove an explicit, compact formula for the inverse Kasteleyn matrix, thus extending numerous results in the case of periodic graphs. We also show an explicit product formula for the partition function; as a specific instance of the genus 0 case, we recover Stanley's formula. We then use our explicit formula for the inverse Kasteleyn matrix to recover, in a simple way, limit shape results; we also obtain new ones. In doing so, we extend the correspondence between the limit shape and the amoeba of the corresponding spectral curve of arXiv:2306.07482 to the case of non-generic weights.

math.PR↗

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 $λ^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 $λ^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 $λ^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↗

Elliptic dimers on minimal graphs and genus 1 Harnack curves

This paper provides a comprehensive study of the dimer model on infinite minimal graphs with Fock's elliptic weights [arXiv:1503.00289]. Specific instances of such models were studied in [arXiv:052711, arXiv:1612.09082, arXiv1801.00207]; we now handle the general genus 1 case, thus proving a non-trivial extension of the genus 0 results of [arXiv:math-ph/0202018, arXiv:math/0311062] on isoradial critical models. We give an explicit local expression for a two-parameter family of inverses of the Kasteleyn operator with no periodicity assumption on the underlying graph. When the minimal graph satisfies a natural condition, we construct a family of dimer Gibbs measures from these inverses, and describe the phase diagram of the model by deriving asymptotics of correlations in each phase. In the $\mathbb{Z}^2$-periodic case, this gives an alternative description of the full set of ergodic Gibbs measures constructed in [arXiv:math-ph/0311005] by Kenyon, Okounkov and Sheffield. We also establish a correspondence between elliptic dimer models on periodic minimal graphs and Harnack curves of genus 1. Finally, we show that a bipartite dimer model is invariant under the shrinking/expanding of 2-valent vertices and spider moves if and only if the associated Kasteleyn coefficients are antisymmetric and satisfy Fay's trisecant identity.

math.PR↗

Minimal bipartite dimers and higher genus Harnack curves

This paper completes the comprehensive study of the dimer model on infinite minimal graphs with Fock's weights [arXiv:1503.00289] initiated in [arXiv:2007.14699]: the latter article dealt with the elliptic case, i.e., models whose associated spectral curve is of genus one, while the present work applies to models of arbitrary genus. This provides a far-reaching extension of the genus zero results of [arXiv:math-ph/0202018, arXiv:math/0311062], from isoradial graphs with critical weights to minimal graphs with weights defining an arbitrary spectral data. For any minimal graph with Fock's weights, we give an explicit local expression for a two-parameter family of inverses of the associated Kasteleyn operator. In the periodic case, this allows us to prove local formulas for all ergodic Gibbs measures, thus providing an alternative description of the measures constructed in [arXiv:math-ph/0311005]. We also compute the corresponding slopes, exhibit an explicit parametrization of the spectral curve, identify the divisor of a vertex, and build on [arXiv:math/0311062, arXiv:1107.5588] to establish a correspondence between Fock's models on periodic minimal graphs and Harnack curves endowed with a standard divisor.

math.PR↗

Isoradial immersions

Isoradial embeddings of planar graphs play a crucial role in the study of several models of statistical mechanics, such as the Ising and dimer models. Kenyon and Schlenker give a combinatorial characterization of planar graphs admitting an isoradial embedding, and describe the space of such embeddings. In this paper we prove two results of the same type for generalizations of isoradial embeddings: isoradial immersions and minimal immersions. We show that a planar graph admits a flat isoradial immersion if and only if its train-tracks do not form closed loops, and that a bipartite graph has a minimal immersion if and only if it is minimal. In both cases we describe the space of such immersions. The techniques used are different in both settings, and distinct from those of Kenyon and Schlenker. We also give an application of our results to the dimer model defined on bipartite graphs admitting minimal immersions.

math.CO↗

Martin boundary of killed random walks on isoradial graphs

We consider killed planar random walks on isoradial graphs. Contrary to the lattice case, isoradial graphs are not translation invariant, do not admit any group structure and are spatially non-homogeneous. Despite these crucial differences, we compute the asymptotics of the Martin kernel, deduce the Martin boundary and show that it is minimal. Similar results on the grid $\mathbb Z^d$ are derived in a celebrated work of Ney and Spitzer.

math.PR↗

The $Z$-invariant Ising model via dimers

The $Z$-invariant Ising model (Baxter in Philos Trans R Soc Lond A Math Phys Eng Sci 289(1359):315--346, 1978) is defined on an isoradial graph and has coupling constants depending on an elliptic parameter $k$. When $k=0$ the model is critical, and as $k$ varies the whole range of temperatures is covered. In this paper we study the corresponding dimer model on the Fisher graph, thus extending our papers (Boutillier and de Tili{è}re in Probab Theory Relat Fields 147:379--413, 2010; Commun Math Phys 301(2):473--516, 2011) to the full $Z$-invariant case. One of our main results is an explicit, local formula for the inverse of the Kasteleyn operator. Its most remarkable feature is that it is an elliptic generalization of Boutillier and de Tili{è}re (2011): it involves a local function and the massive discrete exponential function introduced in Boutillier et al. (Invent Math 208(1):109--189, 2017). This shows in particular that $Z$-invariance, and not criticality, is at the heart of obtaining local expressions. We then compute asymptotics and deduce an explicit, local expression for a natural Gibbs measure. We prove a local formula for the Ising model free energy. We also prove that this free energy is equal, up to constants, to that of the $Z$-invariant spanning forests of Boutillier et al. (2017), and deduce that the two models have the same second order phase transition in $k$. Next, we prove a self-duality relation for this model, extending a result of Baxter to all isoradial graphs. In the last part we prove explicit, local expressions for the dimer model on a bipartite graph corresponding to the XOR version of this $Z$-invariant Ising model.

math.PR↗

Limit shape and height fluctuations of random perfect matchings on square-hexagon lattices

We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square grid or a row of a hexagonal lattice. We assign the graph periodic edge weights with period $1\times n$, and consider the probability measure of perfect matchings in which the probability of each configuration is proportional to the product of edge weights. We show that the partition function of perfect matchings on such a graph can be computed explicitly by a Schur function depending on the edge weights. By analyzing the asymptotics of the Schur function, we then prove the Law of Large Numbers (limit shape) and the Central Limit Theorem (convergence to the Gaussian free field) for the corresponding height functions. We also show that the distribution of certain type of dimers near the turning corner is the same as the eigenvalues of Gaussian Unitary Ensemble, and that in the scaling limit under the boundary condition that each segment of the bottom boundary grows linearly with respect the dimension of the graph, the frozen boundary is a cloud curve whose number of tangent points to the bottom boundary of the domain depends on the size of the period, as well as the number of segments along the bottom boundary.

math.PR↗

Perfect sampling algorithm for Schur processes

We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several fundamental combinatorial objects as special cases, such as plane partitions, tilings of Aztec diamonds, pyramid partitions and more generally steep domino tilings of the plane. Our algorithm, which is of polynomial complexity, is both exact (i.e. the output follows exactly the target probability law, which is either Boltzmann or uniform in our case), and entropy optimal (i.e. it reads a minimal number of random bits as an input). The algorithm encompasses previous growth procedures for special Schur processes related to the primal and dual RSK algorithm, as well as the famous domino shuffling algorithm for domino tilings of the Aztec diamond. It can be easily adapted to deal with symmetric Schur processes and general Schur processes involving infinitely many parameters. It is more concrete and easier to implement than Borodin's algorithm, and it is entropy optimal. At a technical level, it relies on unified bijective proofs of the different types of Cauchy and Littlewood identities for Schur functions, and on an adaptation of Fomin's growth diagram description of the RSK algorithm to that setting. Simulations performed with this algorithm suggest interesting limit shape phenomena for the corresponding tiling models, some of which are new.

math.PR↗

Asymptotic enumeration of perfect matchings in $m$-barrel fullerene graphs

A connected planar cubic graph is called an $m$-barrel fullerene and denoted by $F(m,k)$, if it has the following structure: The first circle is an $m$-gon. Then $m$-gon is bounded by $m$ pentagons. After that we have additional k layers of hexagons. At the last circle $m$-pentagons connected to the second $m$-gon. In this paper we asymptotically count by two different methods the number of perfect matchings in $m$-barrel fullerene graphs, as the number of hexagonal layers is large, and show that the results are equal.

math.CO↗

The $Z$-invariant massive Laplacian on isoradial graphs

We introduce a one-parameter family of massive Laplacian operators $(Δ^{m(k)})_{k\in[0,1)}$ defined on isoradial graphs, involving elliptic functions. We prove an explicit formula for the inverse of $Δ^{m(k)}$, the massive Green function, which has the remarkable property of only depending on the local geometry of the graph, and compute its asymptotics. We study the corresponding statistical mechanics model of random rooted spanning forests. We prove an explicit local formula for an infinite volume Boltzmann measure, and for the free energy of the model. We show that the model undergoes a second order phase transition at $k=0$, thus proving that spanning trees corresponding to the Laplacian introduced by Kenyon are critical. We prove that the massive Laplacian operators $(Δ^{m(k)})_{k\in(0,1)}$ provide a one-parameter family of $Z$-invariant rooted spanning forest models. When the isoradial graph is moreover $\mathbb{Z}^2$-periodic, we consider the spectral curve of the characteristic polynomial of the massive Laplacian. We provide an explicit parametrization of the curve and prove that it is Harnack and has genus $1$. We further show that every Harnack curve of genus $1$ with $(z,w)\leftrightarrow(z^{-1},w^{-1})$ symmetry arises from such a massive Laplacian.

math.PR↗

Dimers on Rail Yard Graphs

We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in the so-called boson-fermion correspondence. This allows to reformulate the RYG dimer model as a Schur process, i.e. as a random sequence of integer partitions subject to some interlacing conditions. Beyond the computation of the partition function, we provide an explicit expression for all correlation functions or, equivalently, for the inverse Kasteleyn matrix of the RYG dimer model. This expression, which is amenable to asymptotic analysis, follows from an exact combinatorial description of the operators localizing dimers in the transfer-matrix formalism, and then a suitable application of Wick's theorem. Plane partitions, domino tilings of the Aztec diamond, pyramid partitions, and steep tilings arise as particular cases of the RYG dimer model. For the Aztec diamond, we provide new derivations of the edge-probability generating function, of the biased creation rate, of the inverse Kasteleyn matrix and of the arctic circle theorem.

math-ph↗

Height representation of XOR-Ising loops via bipartite dimers

The XOR-Ising model on a graph consists of random spin configurations on vertices of the graph obtained by taking the product at each vertex of the spins of two independent Ising models. In this paper, we explicitly relate loop configurations of the XOR-Ising model and those of a dimer model living on a decorated, bipartite version of the Ising graph. This result is proved for graphs embedded in compact surfaces of genus g. Using this fact, we then prove that XOR-Ising loops have the same law as level lines of the height function of this bipartite dimer model. At criticality, the height function is known to converge weakly in distribution to a Gaussian free field. As a consequence, results of this paper shed a light on the occurrence of the Gaussian free field in the XOR-Ising model. In particular, they prove a discrete analogue of Wilson's conjecture, stating that the scaling limit of XOR-Ising loops are "contour lines" of the Gaussian free field.

math.PR↗

The bead model and limit behaviors of dimer models

In this paper, we study the bead model: beads are threaded on a set of wires on the plane represented by parallel straight lines. We add the constraint that between two consecutive beads on a wire; there must be exactly one bead on each neighboring wire. We construct a one-parameter family of Gibbs measures on the bead configurations that are uniform in a certain sense. When endowed with one of these measures, this model is shown to be a determinantal point process, whose marginal on each wire is the sine process (given by eigenvalues of large hermitian random matrices). We prove then that this process appears as a limit of any dimer model on a planar bipartite graph when some weights degenerate.

math.PR↗

Random Young diagrams in a Rectangular Box

We exhibit the limit shape of random Young diagrams having a distribution proportional to the exponential of their area, and confined in a rectangular box. The Ornstein-Uhlenbeck bridge arises from the fluctuations around the limit shape.

math.PR↗

Statistical mechanics on isoradial graphs

Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs naturally arise in two approaches used by physicists: transfer matrices and conformal field theory. This leads us to the fact that isoradial graphs provide a natural setting for discrete complex analysis, to which we dedicate one section. Then, we give an overview of explicit results obtained for different models of statistical mechanics defined on such graphs: the critical dimer model when the underlying graph is bipartite, the 2-dimensional critical Ising model, random walk and spanning trees and the q-state Potts model.

math.PR↗

Loop statistics in the toroidal honeycomb dimer model

The dimer model on a graph embedded in the torus can be interpreted as a collection of random self-avoiding loops. In this paper, we consider the uniform toroidal honeycomb dimer model. We prove that when the mesh of the graph tends to zero and the aspect of the torus is fixed, the winding number of the collection of loops converges in law to a two-dimensional discrete Gaussian distribution. This is known to physicists in more generality from their analysis of toroidal two-dimensional critical loop models and their mapping to the massless free field on the torus. This paper contains the first mathematical proof of this more general physics result in the specific case of the loop model induced by a toroidal dimer model.

math.PR↗