Related papers: Random Cluster Tessellations
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of two dimensional zonotopes, using dynamical systems and order theory. We show that the sets of partitions ordered with a simple…
A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish…
This paper provides a bridge between the classical tiling theory and the complex neighborhood self-assembling situations that exist in practice. The neighborhood of a position in the plane is the set of coordinates which are considered…
In the Hausdorff Voronoi diagram of a set of clusters of points in the plane, the distance between a point t and a cluster P is the maximum Euclidean distance between t and a point in P. This diagram has direct applications in VLSI design.…
Tiny fluctuations of the Cosmic Microwave Background as well as various observable quantities obtained by spin raising and spin lowering of the effective gravitational lensing potential of distant galaxies and galaxy clusters, are described…
We have developed a novel method of determining 2D radial density profiles for astronomical systems of discrete objects using Voronoi tessellations. This Voronoi-based method was tested against the standard annulus-based method on 5…
A random planar quadrangulation process is introduced as an approximation for certain cellular automata in terms of random growth of rays from a given set of points. This model turns out to be a particular (rectangular) case of the…
In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…
In this paper, we construct the Bessel line ensemble, a countable collection of continuous random curves. This line ensemble is stationary under horizontal shifts with the Bessel point process as its one-time marginal. Its finite…
We implement an algorithm RSHT (Random Simple-Homotopy) to study the simple-homotopy types of simplicial complexes, with a particular focus on contractible spaces and on finding substructures in higher-dimensional complexes. The algorithm…
The tenfold classification provides a powerful framework for organizing topological phases of matter based on symmetry and spatial dimension. However, it does not offer a systematic method for transitioning between classes or engineering…
We formulate a simple algorithm for computing global exact symmetries of closed discrete curves in plane. The method is based on a suitable trigonometric interpolation of vertices of the given polyline and consequent computation of the…
Net-trees are a general purpose data structure for metric data that have been used to solve a wide range of algorithmic problems. We give a simple randomized algorithm to construct net-trees on doubling metrics using $O(n\log n)$ time in…
We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…
The AlPdMn quasicrystal approximants xi, xi', and xi'_n of the 1.6 nm decagonal phase and R, T, and T_n of the 1.2 nm decagonal phase can be viewed as arrangements of cluster columns on two-dimensional tilings. We substitute the tiles by…
Random attractors are the time-evolving pullback attractors of stochastically perturbed, deterministically chaotic dynamical systems. These attractors have a structure that changes in time, and that has been characterized recently using…
Based on sketching techniques, we propose two randomized algorithms for tensor ring (TR) decomposition. Specifically, by defining new tensor products and investigating their properties, we apply the Kronecker sub-sampled randomized Fourier…
Matchbox manifolds ${\mathfrak M}$ are a special class of foliated spaces, which includes as special examples exceptional minimal sets of foliations, weak solenoids, suspensions of odometer and Toeplitz actions, and tiling spaces associated…
We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the…