Related papers: Random cubic planar maps

We prove that the random simple cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices admits a novel uniform infinite cubic planar graph (UICPG) as quenched local limit. We describe how the limit may be constructed by a…

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

MapReduce has become the de facto standard model for designing distributed algorithms to process big data on a cluster. There has been considerable research on designing efficient MapReduce algorithms for clustering, graph optimization, and…

We present a way to study the conformal structure of random planar maps. The main idea is to explore the map along an SLE (Schramm--Loewner evolution) process of parameter $ \kappa = 6$ and to combine the locality property of the SLE_{6}…

The process of drawing electoral district boundaries is known as political redistricting. Within this context, gerrymandering is the practice of drawing these boundaries such that they unfairly favor a particular political party, often…

We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…

We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every $d\geq 3$, as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees…

We present different continuous models of random geometry that have been introduced and studied in the recent years. In particular, we consider the Brownian map, which is the universal scaling limit of large planar maps in the…

This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While $st$-orderings do extend to directed graphs, especially…

We show that the size-Ramsey number of any cubic graph with $n$ vertices is $O(n^{8/5})$, improving a bound of $n^{5/3 + o(1)}$ due to Kohayakawa, R\"{o}dl, Schacht, and Szemer\'{e}di. The heart of the argument is to show that there is a…

We prove that large Boltzmann stable planar maps of index $\alpha \in (1;2)$ converge in the scaling limit towards a random compact metric space $\mathcal{S}_{\alpha}$ that we construct explicitly. They form a one-parameter family of random…

In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit $G$ of such graphs. Assume that the…

We introduce two topological non-$\Sigma$ operad structures on planar line arrangements subject to a certain geometric order condition, ensuring a well-defined notion of particle ordering on a distinguished line. This is interpreted in…

We construct a family of birational maps acting on two dimensional projective varieties, for which the growth of the degrees of the iterates is cubic. It is known that this growth can be bounded, linear, quadratic or exponential for such…

We analyse deterministic diffusion in a simple, one-dimensional setting consisting of a family of four parameter dependent, chaotic maps defined over the real line. When iterated under these maps, a probability density function spreads out…