Related papers: Gaskets of $O(2)$ loop-decorated random planar map…
We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…
The loop $O(n)$ model is a model for a random collection of non-intersecting loops on the hexagonal lattice, which is believed to be in the same universality class as the spin $O(n)$ model. It has been conjectured that both the spin and the…
Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second…
We implement new techniques involving Artin fans to study the realizability of tropical stable maps in superabundant combinatorial types. Our approach is to understand the skeleton of a fundamental object in logarithmic Gromov--Witten…
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…
We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…
The largest components of the critical Erd\H{o}s-R\'enyi graph, $G(n,p)$ with $p=1/n$, have size of order $n^{2/3}$ with high probability. We give detailed asymptotics for the probability that there is an unusually large component, i.e. of…
We consider Kac's random walk on $n$-dimensional rotation matrices, where each step is a random rotation in the plane generated by two randomly picked coordinates. We show that this process converges to the Haar measure on $\mathit{SO}(n)$…
The (non-spanning) tree-decorated quadrangulation is a random pair formed by a quadrangulation and a subtree chosen uniformly over the set of pairs with prescribed size. In this paper we study the tree-decorated quadrangulation in the…
Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.
Two-Bar Charts Packing Problem is to pack $n$ two-bar charts (2-BCs) in a minimal number of unit-capacity bins. This problem generalizes the strongly NP-hard Bin Packing Problem. We prove that the problem remains strongly NP-hard even if…
We reformulate the O(N) sigma model as a loop model whose configurations are the all-order strong coupling graphs of the original model. The loop configurations are represented by a pointer list in the computer and a Monte Carlo update…
We introduce an Ulam-type stability condition for positive definite maps defined on a countable group and prove that this condition characterizes amenability.
We study the volume of rigid loop-$O(n)$ quadrangulations with a boundary of length $2p$ in the non-generic critical regime. We prove that, as the half-perimeter $p$ goes to infinity, the volume scales in distribution to an explicit random…
We introduce a general technique for proving estimates for certain random planar maps which belong to the $\gamma$-Liouville quantum gravity (LQG) universality class for $\gamma \in (0,2)$. The family of random planar maps we consider are…
We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…
This is a study of the Wittner capture construction for critically finite quadratic rational maps for which one critical point is periodic, and the second critical point is in the backward orbit of the first. This construction gives a way…
In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…
Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…
The important phenomenon of "stickiness" of chaotic orbits in low dimensional dynamical systems has been investigated for several decades, in view of its applications to various areas of physics, such as classical and statistical mechanics,…