Related papers: Random sampling of plane partitions

In the planted partition problem, the $n$ vertices of a random graph are partitioned into $k$ "clusters," and edges between vertices in the same cluster and different clusters are included with constant probability $p$ and $q$, respectively…

We present a reduced-dimension, ballistic deposition, Monte Carlo particle packing algorithm and discuss its application to the analysis of the microstructure of hard-sphere systems with broad particle size distributions. We extend our…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…

Generating random variates from high-dimensional distributions is often done approximately using Markov chain Monte Carlo. In certain cases, perfect simulation algorithms exist that allow one to draw exactly from the stationary…

We derive a formula for the expected number of blocks of a given size from a non-crossing partition chosen uniformly at random. Moreover, we refine this result subject to the restriction of having a number of blocks given. Furthermore, we…

Given a source of iid samples of edges of an input graph $G$ with $n$ vertices and $m$ edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in $G$? Moreover, is it possible to obtain…

We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.

This paper gives new, efficient algorithms for approximate uniform sampling of contingency tables and integer partitions. The algorithms use the Burnside process, a general algorithm for sampling a uniform orbit of a finite group acting on…

Extracting planes from a 3D scene is useful for downstream tasks in robotics and augmented reality. In this paper we tackle the problem of estimating the planar surfaces in a scene from posed images. Our first finding is that a surprisingly…

We consider the problem of computing Shapley values for points in the plane, where each point is interpreted as a player, and the value of a coalition is defined by the area of usual geometric objects, such as the convex hull or the minimum…

We generalize categories of spatial partitions in the sense of C\'ebron-Weber by introducing new base partitions. This allows us to construct additional examples of free orthogonal quantum groups but yields the same class of spatial…

We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of $n$ items and that the available workspace is $\Theta(s)$ bits, where $\lg n \leq s \leq n…

Given a set of N points, we have discovered an algorithm that can separate these points from one another by n-dimensional planes. Each point is chosen at random and put into a set S and planes which separate them are determined and put into…

This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…

We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…

We present an algorithm for sampling tightly confined random equilateral closed polygons in three-space which has runtime linear in the number of edges. Using symplectic geometry, sampling such polygons reduces to sampling a moment…

We consider MAP estimators for structured prediction with exponential family models. In particular, we concentrate on the case that efficient algorithms for uniform sampling from the output space exist. We show that under this assumption…

We present a model of one-dimensional irreversible adsorption in which particles once adsorbed immediately shrink to a smaller size or expand to a larger size. Exact solutions for the fill factor and the particle number variance as a…