Related papers: Random Cluster Tessellations
One well studied way to construct quasicrystalline tilings is via inflate-and-subdivide (a.k.a. substitution) rules. These produce self-similar tilings--the Penrose, octagonal, and pinwheel tilings are famous examples. We present a…
The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing to encode such structures into labeled maps with a…
Network models provide a powerful and flexible framework for analyzing a wide range of structured data sources. In many situations of interest, however, multiple networks can be constructed to capture different aspects of an underlying…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
Random Wavelet Series form a class of random processes with multifractal properties. We give three applications of this construction. First, we synthesize a random function having any given spectrum of singularities satisfying some…
The application of Voronoi and Delaunay tessellation based methods for reconstructing continuous fields from discretely sampled data sets is discussed. The succesfull operation as ``multidimensional interpolation'' method is corroborated…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
Given a countable set of points in a continuous space, Voronoi tessellation is an intuitive way of partitioning the space according to the distance to the individual points. As a powerful approach to obtain structural information, it has a…
The large-scale matter distribution represents a complex network of structure elements such as voids, clusters, filaments, and sheets. This network is spanned by a point distribution. The global properties of the point process can be…
We propose a randomized algorithm for enumerating the vertices of a zonotope, which is a low-dimensional linear projection of a hypercube. The algorithm produces a pair of the zonotope's vertices by sampling a random linear combination of…
We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as…
We study percolation and the random cluster model on the triangular lattice with 3-body interactions. Starting with percolation, we generalize the star--triangle transformation: We introduce a new parameter (the 3-body term) and identify…
How, in principle, could one solve the atomic structure of a quasicrystal, modeled as a random tiling decorated by atoms, and what techniques are available to do it? One path is to solve the phase problem first, obtaining the density in a…
There is a growing body of results in the theory of discrete point sets and tiling systems giving conditions under which such systems are pure point diffractive. Here we look at the opposite direction: what can we infer about a discrete…
We survey recent results on determinantal processes, random growth, random tilings and their relation to random matrix theory.
We introduce a new general framework for constructing tilings of Euclidean space, which we call multiscale substitution tilings. These tilings are generated by substitution schemes on a finite set of prototiles, in which multiple distinct…
A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…
Generative approaches to clustering provide information on geometric properties of clusters, whereas discriminative approaches provide boundaries between clusters. Ideas from both approaches are incorporated to present a fully unsupervised,…